A complexity theory based on Boolean algebra

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: S. Skyum Univ. of Edinburgh, Edinburgh, Scotland
L. G. Valiant Univ. of Edinburgh, Edinburgh, Scotland
Published in:
· Journal
Journal of the ACM (JACM) JACM Homepage archive
Volume 32 Issue 2, April 1985
Pages 484-502
ACM New York, NY, USA
table of contents doi>10.1145/3149.3158
A complexity theory based on Boolean algebra Published by ACM 1985 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 56
· Downloads (cumulative): 796
· Citation Count: 16


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