Unique games on expanding constraint graphs are easy: extended abstract

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Sanjeev Arora Princeton University, Princeton, NJ, USA
Subhash A. Khot Courant Institue of Mathematical Sciences, New York University, New York, NY, USA
Alexandra Kolla University of California, Berkeley, Berkeley, CA, USA
David Steurer Princeton University, Princeton, NJ, USA
Madhur Tulsiani University of California, Berkeley, Berkeley, CA, USA
Nisheeth K. Vishnoi IBM India Research Lab, Delhi, India
Unique games on expanding constraint graphs are easy: extended abstract Published by ACM 2008 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 10
· Downloads (12 Months): 31
· Downloads (cumulative): 564
· Citation Count: 14

Published in:
Cover Image
 
· Proceeding
STOC '08 Proceedings of the 40th annual ACM symposium on Theory of computing
Pages 21-28
ACM New York, NY, USA ©2008
table of contents ISBN: 978-1-60558-047-0 doi>10.1145/1374376.1374380

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