The polynomial-time hierarchy
- 1 October 1976
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 3 (1) , 1-22
- https://doi.org/10.1016/0304-3975(76)90061-x
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Complete sets and the polynomial-time hierarchyTheoretical Computer Science, 1976
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975
- Space-bounded reducibility among combinatorial problemsJournal of Computer and System Sciences, 1975
- Postscript about NP-hard problemsACM SIGACT News, 1974
- Time bounded random access machinesJournal of Computer and System Sciences, 1973
- A note on disjunctive form tautologiesACM SIGACT News, 1973
- Word problems requiring exponential time(Preliminary Report)Published by Association for Computing Machinery (ACM) ,1973
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971
- Relationships between nondeterministic and deterministic tape complexitiesJournal of Computer and System Sciences, 1970
- Hierarchies of memory limited computationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1965