Parity, circuits, and the polynomial-time hierarchy
- 1 December 1984
- journal article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 17 (1) , 13-27
- https://doi.org/10.1007/bf01744431
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Parity, circuits, and the polynomial-time hierarchyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- AlternationJournal of the ACM, 1981
- On counting problems and the polynomial-time hierarchyTheoretical Computer Science, 1980
- A 3n-lower bound on the network complexity of Boolean functionsTheoretical Computer Science, 1980
- A second step toward the polynomial hierarchyTheoretical Computer Science, 1979
- Relativization of questions about log space computabilityTheory of Computing Systems, 1976
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975
- Method of determining lower bounds for the complexity of P-schemesMathematical Notes, 1971
- Complexity of the realization of a linear function in the class of II-circuitsMathematical Notes, 1971