Erratum: The Polynomial Time Hierarchy Collapses If the Boolean Hierarchy Collapses
From MaRDI portal
Publication:3971675
DOI10.1137/0220025zbMath0798.03044OpenAlexW4255515059MaRDI QIDQ3971675
Publication date: 25 June 1992
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0220025
Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (2)
The complexity of online manipulation of sequential elections ⋮ Exact complexity of exact-four-colorability
This page was built for publication: Erratum: The Polynomial Time Hierarchy Collapses If the Boolean Hierarchy Collapses
