Recursive Properties of Abstract Complexity Classes

doi:10.1145/321694.321702

Recursive Properties of Abstract Complexity Classes

Full Text:

PDF

Buy this Article

Authors:	L. H. Landweber	Computer Science Department, University of Wisconsin, 1210 West Dayton Street, Madison, WI
	E. L. Robertson	University of Wisconsin, Madison, Wisconsin

Published in:

· Journal

Journal of the ACM (JACM) JACM Homepage archive

Volume 19 Issue 2, April 1972
Pages 296-308
ACM New York, NY, USA
table of contents doi>10.1145/321694.321702

	1972 Article
Bibliometrics
· Downloads (6 Weeks): 0 · Downloads (12 Months): 7 · Downloads (cumulative): 310 · Citation Count: 10

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Share:

|

Tags: algorithms complexity measures and classes measurement performance recursive function theory theory verification

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder