Downward Separation Fails Catastrophically for Limited Nondeterminism Classes

DOI10.1137/S0097539794277421MaRDI QIDQ4210115zbMATH OpenFDO

Authors

Publication date 21 September 1998

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0097539794277421

zbMATH Keywords

hierarchieslimited nondeterminismoraclesstructural complexity theory

Mathematics Subject Classification ID

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

Recommendations

• Defying upward and downward separation
• scientific article; zbMATH DE number 512827
• Separating the low and high hierarchies by oracles

Cited in

(4)

• Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines.
• Molecular computing, bounded nondeterminism, and efficient recursion
• Intersection suffices for Boolean hierarchy equivalence
• On quasilinear-time complexity theory

This page was built for publication: Downward Separation Fails Catastrophically for Limited Nondeterminism Classes

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