On problems solvable by successive trials
- 1 January 1975
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Comparison of polynomial-time reducibilitiesPublished by Association for Computing Machinery (ACM) ,1974
- Computational complexity of probabilistic Turing machinesPublished by Association for Computing Machinery (ACM) ,1974
- On the lengths of proofs in the propositional calculus (Preliminary Version)Published by Association for Computing Machinery (ACM) ,1974
- Polynominal time reducibilityPublished by Association for Computing Machinery (ACM) ,1973
- Word problems requiring exponential time(Preliminary Report)Published by Association for Computing Machinery (ACM) ,1973
- Formalization of Some Notions in Terms of Computational ComplexityPublished by Elsevier ,1973
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971