Negation can be exponentially powerful

Full Text: PDFPDF Buy this ArticleBuy this Article
Author: L. G. Valiant
Published in:
· Proceeding
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Pages 189-196
ACM New York, NY, USA ©1979
table of contents doi>10.1145/800135.804412
Negation can be exponentially powerful Published by ACM 1979 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 23
· Downloads (cumulative): 248
· Citation Count: 2


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