Separating the polynomial-time hierarchy by oracles
Proc. 26th annual symposium on Foundations of computer science
The polynomial-time hierarchy and sparse oracles
Journal of the ACM (JACM)
On the construction of parallel computers from various bases of Boolean functions
Theoretical 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
Probabilistic quantifiers and games
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
Complexity classes without machines: on complete languages for UP
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
SIAM Journal on Computing
The polynomial time hierarchy collapses if the Boolean hierarchy collapses
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
The ismorphism conjecture fails relative to a random oracle
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Oracles versus proof techniques that do not relativize
SIGAL '90 Proceedings of the international symposium on Algorithms
Robust machines accept easy sets
Theoretical Computer Science
PP is as hard as the polynomial-time hierarchy
SIAM Journal on Computing
Reductions to sets of low information content
Complexity theory
An observation on probability versus randomness with applications to complexity classes
Mathematical Systems Theory
Space-efficient recognition of sparse self-reducible languages
Computational Complexity
Threshold Computation and Cryptographic Security
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
Defying Upward and Downward Separation
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Two remarks on the power of counting
Proceedings of the 6th GI-Conference on Theoretical Computer Science
On Some Central Problems in Computational Complexity
On Some Central Problems in Computational Complexity
Upward Separation for FewP and Related Classes
Upward Separation for FewP and Related Classes
ACM SIGACT News
A Short Guide To Approximation Preserving Reductions
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
| Hi-index | 0.00 |