With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Private coins versus public coins in interactive proof systems
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Trading group theory for randomness
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Probability one separation of the Boolean hierarchy
4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
Does co-NP have short interactive proofs?
Information Processing Letters
Are there interactive protocols for CO-NP languages?
Information Processing Letters
The Boolean hierarchy I: structural properties
SIAM Journal on Computing
The polynomial time hierarchy collapses if the Boolean hierarchy collapses
SIAM Journal on Computing
Multi-prover interactive proofs: how to remove intractability assumptions
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Relativized polynomial time hierarchies having exactly K levels
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
The ismorphism conjecture fails relative to a random oracle
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Structural Complexity Theory: recent Surprises
SWAT '90 Proceedings of the 2nd Scandinavian Workshop on Algorithm Theory
On the random oracle hypothesis
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Some connections between nonuniform and uniform complexity classes
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Computational models of games
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Separating the polynomial-time hierarchy by oracles
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Algebraic methods for interactive proof systems
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
A taxonomy of proof systems (part 2)
ACM SIGACT News
ACM SIGACT News
Probabilistic checking of proofs: a new characterization of NP
Journal of the ACM (JACM)
Category, Measure, Inductive Inference: A Triality Theorem and Its Applications
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Hausdorff dimension and oracle constructions
Theoretical Computer Science
Complexity theory made easy: the formal language approach to the definition of complexity classes
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Algorithmic randomness, quantum physics, and incompleteness
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
| Hi-index | 0.00 |
In this paper, P(#P) and PF(#P) are characterized in terms of a largely different computation structure, where P(#P) (resp., PF(#P)) is the class of sets (resp., functions) that are polynomial-time Turing reducible to #P functions. Let MidP be the class ...