Extending Downward Collapse from 1-versus-2 Queries tom-versus-m+ 1 Queries
DOI10.1137/S0097539701391002zbMath1082.68035MaRDI QIDQ5317200
Edith Hemaspaandra, Hemaspaandra, Lane A., Harald Hempel
Publication date: 16 September 2005
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Boolean hierarchypolynomial hierarchycomputational complexity theorydownward collapsedownward translation of equalityno-search easy-hard techniqueupward separation
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (2)
This page was built for publication: Extending Downward Collapse from 1-versus-2 Queries tom-versus-m+ 1 Queries