Simultaneous strong separations of probabilistic and unambiguous complexity classes
David Eppstein,
Lane A. Hemachandra,
James Tisdall,
and Bülent Yener
Mathematical Systems Theory 25(1):23–36, 1992
Mathematical Reviews 92j:68031
http://www.ics.uci.edu/~eppstein/pubs/EppHemTis-MST-92.pdf
Cited by:
- Fault-tolerance and complexity
- Strong self-reducibility precludes strong immunity
- Existential theorems in computational complexity: size and robustness
- Immunity and simplicity for exact counting and other counting classes
- Complexity of Certificates, Heuristics, and Counting Types, with Applicatins to Cryptography and Circuit Theory
