Existential theorems in computational complexity: size and robustness

Marius Zimand
Ph.D. thesis, Univ. of Rochester, Dept. of Computer Science, 1996
http://www.cs.rochester.edu/users/grads/zimand/thesis.html

Cites:

Simultaneous strong separations of probabilistic and unambiguous complexity classes

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine