On Effective Procedures for Speeding Up Algorithms

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

On Effective Procedures for Speeding Up Algorithms

Full text

Pdf (873 KB)

Source

Journal of the ACM (JACM) archive
Volume 18 , Issue 2 (April 1971) table of contents

Pages: 290 - 305

Year of Publication: 1971

ISSN:0004-5411

Author

Manuel Blum

Electronics Research Laboratory, Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, California

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 19, Citation Count: 6

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/321637.321648 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	HARTMANIS, J., AND STEARNS, R.E. On the computational complexity of algorithms. Trans. Amer. Math. Soc. 117, 5 (May 1965), 285-306.
	2	Manuel Blum, A Machine-Independent Theory of the Complexity of Recursive Functions, Journal of the ACM (JACM), v.14 n.2, p.322-336, April 1967 [doi>10.1145/321386.321395]
	3	MEYER, A. R., AND FISCHER, P.C. On computational speedup. IEEE Conference Record Ninth Annual Symposium on Switching and Automata Theory (Oct. 1968), 351-355.
	4	Paul R. Young, Speed-ups by changing the order in which sets are enumerated (Preliminary Version), Proceedings of the first annual ACM symposium on Theory of computing, p.89-92, May 05-07, 1969, Marina del Rey, California, United States [doi>10.1145/800169.805424]
	5	ROGERS, H., JR. G6del numberings of partial recursive functions. J. Symb. Logic 23, 3 (Sept. 1958), 331-341.
	6	Hartley Rogers, Jr., Theory of recursive functions and effective computability, MIT Press, Cambridge, MA, 1987
	7	YOUNG, P. R., AND HELM, J. P. On the size and efficiency of programs. Research Rep. CDS TR43, Dep. of Computer Science, Purdue U., Lafayette, Ind. (1969).
	8	RITCHIE, D.M. Program structure and computational complexity. Ph.D. Thesis, Dep. of Math. Harvard U., Cambridge, Mass. (1968).
	9	YOUNG, P.R. Toward a theory of enumerations. IEEE Conference Record Ninth Annual Symposium on Switching and Automata Theory (Oct. 1968), 334--350.

CITED BY 6

	Paul Young, Optimization Among Provably Equivalent Programs, Journal of the ACM (JACM), v.24 n.4, p.693-700, Oct. 1977
	L. J. Stockmeyer , A. R. Meyer, Word problems requiring exponential time(Preliminary Report), Proceedings of the fifth annual ACM symposium on Theory of computing, p.1-9, April 30-May 02, 1973, Austin, Texas, United States
	Robert L. Constable, Type two computational complexity, Proceedings of the fifth annual ACM symposium on Theory of computing, p.108-121, April 30-May 02, 1973, Austin, Texas, United States
	Andrea Asperti, The intensional content of Rice's theorem, ACM SIGPLAN Notices, v.43 n.1, January 2008
	Patrick C. Fischer, Theory of computing in computer science education, Proceedings of the November 16-18, 1971, fall joint computer conference, November 16-18, 1971, Las Vegas, Nevada
	Steven Minton , Jaime G. Carbonell, Strategies for learning search control rules: an explanation-based approach, Proceedings of the 10th international joint conference on Artificial intelligence, p.228-235, August 23-29, 1987, Milan, Italy