Short propositional formulas represent nondeterministic computations
- 11 January 1988
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 26 (5) , 269-270
- https://doi.org/10.1016/0020-0190(88)90152-4
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Relations Among Complexity MeasuresJournal of the ACM, 1979
- Satisfiability Is Quasilinear Complete in NQLJournal of the ACM, 1978
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971