Optimization problems and the polynomial hierarchy
- 31 December 1981
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 15 (3) , 279-289
- https://doi.org/10.1016/0304-3975(81)90082-7
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- A second step toward the polynomial hierarchyTheoretical Computer Science, 1979
- Polynomial Time Enumeration ReducibilitySIAM Journal on Computing, 1978
- Independence results in computer scienceACM SIGACT News, 1976
- P-Complete Approximation ProblemsJournal of the ACM, 1976
- Translational lemmas, polynomial time, and (log n)j-spaceTheoretical Computer Science, 1976
- A comparison of polynomial time reducibilitiesTheoretical Computer Science, 1975
- Computationally Related ProblemsSIAM Journal on Computing, 1974
- The equivalence problem for regular expressions with squaring requires exponential spacePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1972
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971