A quantifier characterization for nondeterministic log space
- 1 November 1975
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGACT News
- Vol. 7 (4) , 24-25
- https://doi.org/10.1145/990502.990504
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Complete problems for deterministic polynomial timePublished by Association for Computing Machinery (ACM) ,1974
- Word problems requiring exponential time(Preliminary Report)Published by Association for Computing Machinery (ACM) ,1973
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971