A circuit-based proof of Toda's theorem

DOI10.1006/INCO.1993.1033MaRDI QIDQ2366565zbMATH OpenOpenAlexFDO

Authors H. Venkateswaran, V. Vinay, R. Kannan, Andrew Chi-Chih Yao

Publication date 30 August 1993

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/inco.1993.1033

zbMATH Keywords

polynomial hierarchyrandomized reductions

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• A simple proof of Toda's theorem
• scientific article; zbMATH DE number 638299
• PP is as Hard as the Polynomial-Time Hierarchy
• A complex analogue of Toda's theorem

Cited in

(8)

• Probabilistic polynomials, AC\(^ 0\) functions and the polynomial-time hierarchy
• Circuit complexity before the dawn of the new millennium
• Derandomizing isolation in space-bounded settings
• On ACC
• Non-commutative arithmetic circuits: depth reduction and size lower bounds
• Nonuniform ACC circuit lower bounds
• Uniform proofs of ACC representations
• A simple proof of Toda's theorem

This page was built for publication: A circuit-based proof of Toda's theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2366565)