Classes of bounded nondeterminism
- 1 December 1990
- journal article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 23 (1) , 21-32
- https://doi.org/10.1007/bf02090764
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- On the power of parity polynomial timePublished by Springer Nature ,2005
- On helping by robust oracle machinesTheoretical Computer Science, 1987
- Robust algorithms: A different approach to oraclesTheoretical Computer Science, 1985
- Immunity, Relativizations, and NondeterminismSIAM Journal on Computing, 1984
- Refining Nondeterminism in Relativizations of Complexity ClassesJournal of the ACM, 1983
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977
- Complete problems for deterministic polynomial timeTheoretical Computer Science, 1976
- Relative complexity of checking and evaluatingInformation Processing Letters, 1976
- On the Structure of Polynomial Time ReducibilityJournal of the ACM, 1975
- Tally languages and complexity classesInformation and Control, 1974