Nondeterminism within P
- 13 November 2005
- book chapter
- Published by Springer Nature
- p. 348-359
- https://doi.org/10.1007/bfb0020811
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Classes of bounded nondeterminismTheory of Computing Systems, 1990
- The Complexity of Very Simple Boolean Formulas with ApplicationsSIAM Journal on Computing, 1990
- Complexity classes with complete problems between P and NP-CPublished by Springer Nature ,1989
- Nearly linear timePublished by Springer Nature ,1989
- On the complexity of fixed parameter problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Short propositional formulas represent nondeterministic computationsInformation Processing Letters, 1988
- research-articleThe Journal of Symbolic Logic, 1986
- Refining Nondeterminism in Relativized Polynomial-Time Bounded ComputationsSIAM Journal on Computing, 1980
- Satisfiability Is Quasilinear Complete in NQLJournal of the ACM, 1978