Parity, circuits, and the polynomial-time hierarchy
- 1 October 1981
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)
- p. 260-270
- https://doi.org/10.1109/sfcs.1981.35
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- AlternationJournal of the ACM, 1981
- On counting problems and the polynomial-time hierarchyTheoretical Computer Science, 1980
- Relativization of questions about log space computabilityTheory of Computing Systems, 1976
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975
- Word problems requiring exponential time(Preliminary Report)Published by Association for Computing Machinery (ACM) ,1973