Optimal algorithms and inapproximability results for every CSP?

Full Text: PDFPDF Buy this ArticleBuy this Article
Author: Prasad Raghavendra University of Washington, Seattle, WA, USA
Published in:
Cover Image
 
· Proceeding
STOC '08 Proceedings of the 40th annual ACM symposium on Theory of computing
Pages 245-254
ACM New York, NY, USA ©2008
table of contents ISBN: 978-1-60558-047-0 doi>10.1145/1374376.1374414
Optimal algorithms and inapproximability results for every CSP? Published by ACM 2008 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 9
· Downloads (12 Months): 100
· Downloads (cumulative): 624
· Citation Count: 51


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