SIGN IN
SIGN UP
Hardness amplification proofs require majority
Full Text:
PDF
Buy this Article
Authors:
Ronen Shaltiel
University of Haifa, Haifa, Israel
Emanuele Viola
Columbia University, New York, USA
Published in:
· Proceeding
STOC '08 Proceedings of the 40th annual ACM symposium on Theory of computing
Pages 589-598
ACM
New York, NY
, USA
©2008
table of contents
ISBN: 978-1-60558-047-0
doi>
10.1145/1374376.1374461
2008 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 19
· Downloads (cumulative): 202
· Citation Count: 7
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC'13
Share:
|
Tags:
amplification
average-case complexity
black-box
complexity measures and classes
constant-depth circuits
hardness
majority
natural proofs
theory
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 Guide to Computing Literature
All Tags
Export Formats
Save to Binder