New problems complete for nondeterministic log space
- 1 December 1976
- journal article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 10 (1) , 1-17
- https://doi.org/10.1007/bf01683259
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Space-bounded reducibility among combinatorial problemsJournal of Computer and System Sciences, 1975
- On the complexity of LR(k) testingPublished by Association for Computing Machinery (ACM) ,1975
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970
- The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machinesJournal of the ACM, 1968