STRONG SEPARATIONS FOR THE BOOLEAN HIERARCHY OVER RP

DOI10.1142/S0129054190000151zbMath0732.68039OpenAlexW2031174906MaRDI QIDQ3358228

No author found.

Publication date: 1990

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054190000151

zbMATH Keywords

immunitycomplexity theorysimplicityoraclecomplexity classesboolean hierarchies

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (5)

Immunity and Simplicity for Exact Counting and Other Counting Classes ⋮ A downward translation in the polynomial hierarchy ⋮ Simultaneous strong separations of probabilistic and unambiguous complexity classes ⋮ Universally serializable computation ⋮ Quantum and classical complexity classes: Separations, collapses, and closure properties

This page was built for publication: STRONG SEPARATIONS FOR THE BOOLEAN HIERARCHY OVER RP