On the relativization of deterministic and nondeterministic complexity classes
- 1 January 1976
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- On problems solvable by successive trialsLecture Notes in Computer Science, 1975
- Comparing complexity classesJournal of Computer and System Sciences, 1974
- Comparison of polynomial-time reducibilitiesPublished by Association for Computing Machinery (ACM) ,1974
- A hierarchy for nondeterministic time complexityJournal of Computer and System Sciences, 1973
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970