Amplifying lower bounds by means of self-reducibility

doi:10.1145/1706591.1706594

Amplifying lower bounds by means of self-reducibility

Full Text:

PDF

Buy this Article

Authors:	Eric Allender	Rutgers University, Rutgers, New Jersey, New Brunswick, NJ
	Michal Koucký	Academy of Sciences of the Czech Republic, Prague, Czech Republic

Published in:

	· Journal
	Journal of the ACM (JACM) JACM Homepage archive
	Volume 57 Issue 3, March 2010 Article No. 14 ACM New York, NY, USA table of contents doi>10.1145/1706591.1706594

	2010 Article Research Refereed
Bibliometrics
· Downloads (6 Weeks): 3 · Downloads (12 Months): 55 · Downloads (cumulative): 356 · Citation Count: 0

Tools and Resources

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

Share:

|

Tags: circuit complexity lower bounds natural proofs reducibility and completeness relations among complexity classes self-reducibility theory time-space tradeoffs

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