On the random oracle hypothesis
Information and Control
Separating the polynomial-time hierarchy by oracles
Proc. 26th annual symposium on Foundations of computer science
Computational limitations of small-depth circuits
Computational limitations of small-depth circuits
Random oracles separate PSPACE from the polynomial-time hierarchy
Information Processing Letters
Randomness, provability, and the separation of Monte Carlo time and space
Computation theory and logic
The Boolean hierarchy I: structural properties
SIAM Journal on Computing
The polynomial time hierarchy collapses if the Boolean hierarchy collapses
SIAM Journal on Computing
The Boolean hierarchy II: applications
SIAM Journal on Computing
With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Probabilistic computation and linear time
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Robust machines accept easy sets
Theoretical Computer Science
An oracle separating ⊕ P from PPPH
Information Processing Letters
A note on almost-everywhere-complex sets and separating deterministic-time-complexity classes
Information and Computation
PP is as hard as the polynomial-time hierarchy
SIAM Journal on Computing
Theoretical Computer Science
Circuit size relative to pseudorandom oracles
Theoretical Computer Science - Special issue on structure in complexity theory
Almost-everywhere complexity hierarchies for nondeterministic time
Theoretical Computer Science
Gap-definable counting classes
Journal of Computer and System Sciences
The random oracle hypothesis is false
Journal of Computer and System Sciences
Journal of Computer and System Sciences
On collapsing the polynomial-time hierarchy
Information Processing Letters
On the computational power of depth 2 circuits with threshold and modulo gates
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Applied Mathematics and Computation
PP is closed under intersection
Selected papers of the 23rd annual ACM symposium on Theory of computing
Closure properties and witness reduction
Journal of Computer and System Sciences
Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets
SIAM Journal on Computing
On Randomized Versus Deterministic Computation
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Lower Space Bounds for Randomized Computation
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Oracles versus Proof Techniques that Do Not Relativize
SIGAL '90 Proceedings of the International Symposium on Algorithms
Gap-Definability as a Closure Property
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Probability One Separation of the Boolean Hierarchy
STACS '87 Proceedings of the 4th Annual Symposium on Theoretical Aspects of Computer Science
The resolution of a Hartmanis conjecture
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Sparse P-hard sets yield space-efficient algorithms
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
The PL Hierarchy Collapses
On Randomized Cryptographic Primitives
On Randomized Cryptographic Primitives
The future of computational complexity theory: part I
ACM SIGACT News
LWPP and WPP are not uniformly gap-definable
Journal of Computer and System Sciences
| Hi-index | 0.00 |
We last had an "open problems" column eighteen months ago [Hem94]. It contained seven problems. Of the seven, one has since been resolved (at least insofar as one can resolve the problem without outright collapsing complexity classes) in an exciting FOCS paper by Cai and Sivakumar ([CS95], see also [Ogi95b,CNS95]), and for another I received a proof via email unfortunately followed quickly by another email retracting the proof. Overall score:Mysteries of Complexity Theory: 6.Theoretical Computer Scientists:1.If you go to Atlantic City, you know which side to bet on! But be of good cheer. This issue's column contains a new list of open problems (though some favorites from the old list have stowed away here too). And to stack the deck in favor of theoretical computer scientists, the problems are posed quite obliquely. Rather than asking you to prove "X," many of the problems (e.g., Problems 2, 4, 5, 6, and 7) just ask you to show that "In some oracle world, X." Sound easy? Dig in! And if your attempt to find a world where X holds becomes too frustrating, don't hesitate to go for the real glory --- by proving that X fails in the real world (and every relativized world)!