A note on deterministic and nondeterministic time complexity
- 31 December 1982
- journal article
- Published by Elsevier in Information and Control
- Vol. 55 (1-3) , 117-124
- https://doi.org/10.1016/s0019-9958(82)90515-0
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A uniform approach to obtain diagonal sets in complexity classesTheoretical Computer Science, 1982
- On the structure of sets in NP and other complexity classesTheoretical Computer Science, 1981
- A note on structure and looking back applied to the relative complexity of computable functionsJournal of Computer and System Sciences, 1981
- Complete sets and the polynomial-time hierarchyTheoretical Computer Science, 1976
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- On the Structure of Polynomial Time ReducibilityJournal of the ACM, 1975