On the virtue of succinct proofs: amplifying communication complexity hardness to time-space trade-offs in proof complexity

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Trinh Huynh Swiss Federal Institute of Technology, Zurich, Switzerland
Jakob Nordstrom KTH Royal Institute of Technology, Stockholm, Sweden
Published in:
Cover Image
 
· Proceeding
STOC '12 Proceedings of the 44th symposium on Theory of Computing
Pages 233-248
ACM New York, NY, USA ©2012
table of contents ISBN: 978-1-4503-1245-5 doi>10.1145/2213977.2214000
On the virtue of succinct proofs: amplifying communication complexity hardness to time-space trade-offs in proof complexity Published by ACM 2012 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 6
· Downloads (12 Months): 84
· Downloads (cumulative): 84
· Citation Count: 0


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


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