Generix strikes again

DOI10.2307/2274746zbMath0685.03032OpenAlexW2077372165MaRDI QIDQ4735185

Bruno Poizat

Publication date: 1989

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2274746

zbMATH Keywords

surveyrelativizationsrelativized polynomial hierarchy

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15)

Related Items

Generix never gives up

Cites Work

• On counting problems and the polynomial-time hierarchy
• A second step toward the polynomial hierarchy
• Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1
• Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question