A second step toward the polynomial hierarchy
Authors:
- Theodore P. BakerTBTheodore P. Baker
- Alan L. SelmanASAlan L. Selman
- 31 December 1979
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 8 (2) , 177-187
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Complete sets and the polynomial-time hierarchyTheoretical Computer Science, 1976
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975
- The equivalence problem for regular expressions with squaring requires exponential space1972
- Recursive predicates and quantifiersTransactions of the American Mathematical Society, 1943