Abstract
Most of the interesting open problems about relationships between complexity classes have either been resolved or have relativizable worlds in both directions. We discuss some remaining open questions, updating questions from a similar 1995 survey of Hemaspaandra, Ramachandra and Zimand and adding a few new problems.
Publisher
Association for Computing Machinery (ACM)
Reference40 articles.
1. The need for structure in quantum speedups;Aaronson Scott;Theory of Computing,2014
2. [Aar] S. Aaronson. Complexity Zoo. http://complexityzoo.net. [Aar] S. Aaronson. Complexity Zoo. http://complexityzoo.net.
3. Quantum computability;Adleman L.;SIAM Journal on Computing,1997
4. Relativized counting classes: relations among thresh- olds, parity and mods;Beigel R.;Journal of Computer and System Sciences,1991