Downward Separation Fails Catastrophically for Limited Nondeterminism Classes
From MaRDI portal
Publication:4210115
DOI10.1137/S0097539794277421zbMath0907.68083MaRDI QIDQ4210115
No author found.
Publication date: 21 September 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Related Items
Intersection suffices for Boolean hierarchy equivalence, Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines., On quasilinear-time complexity theory, Molecular computing, bounded nondeterminism, and efficient recursion