Complexity classes without machines: On complete languages for UP
Authors:
- 1 January 1986
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 123-135
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- The boolean hierarchy: Hardware over NP1986
- On the unique satisfiability problemInformation and Control, 1982
- Relationship between density and deterministic complexity of MP-complete languages1978
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977
- Relative complexity of checking and evaluatingInformation Processing Letters, 1976
- The complexity of theorem-proving procedures1971