An efficient parallel repetition theorem for Arthur-Merlin games

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Rafael Pass Cornell University, Ithaca, NY
Muthuramakrishnan Venkitasubramaniam Cornell University, Ithaca, NY
Published in:
· Proceeding
STOC '07 Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Pages 420 - 429
ACM New York, NY, USA ©2007
table of contents ISBN: 978-1-59593-631-8 doi>10.1145/1250790.1250853
An efficient parallel repetition theorem for Arthur-Merlin games Published by ACM 2007 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 13
· Downloads (cumulative): 263
· Citation Count: 10


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