Separating the polynomial-time hierarchy by oracles
Proc. 26th annual symposium on Foundations of computer science
Relativized circuit complexity
Journal of Computer and System Sciences
Complexity and structure
The polynomial-time hierarchy and sparse oracles
Journal of the ACM (JACM)
Almost optimal lower bounds for small depth circuits
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Sparse sets lowness and highness
SIAM Journal on Computing
Recursively enumerable sets and degrees
Recursively enumerable sets and degrees
Computational limitations of small-depth circuits
Computational limitations of small-depth circuits
Algebraic methods in the theory of lower bounds for Boolean circuit complexity
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Information and Computation
The complexity of optimization problems
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
Query-limited reducibilities
On sets truth-table reducible to sparse sets
SIAM Journal on Computing
Information and Computation
Probalisitic complexity classes and lowness
Journal of Computer and System Sciences
Lower bounds for constant-depth circuits in the presence of help bits
Information Processing Letters
A note on enumerative counting
Information Processing Letters
The complexity of finite functions
Handbook of theoretical computer science (vol. A)
Bounded queries to SAT and the Boolean hierarchy
Theoretical Computer Science
PP is as hard as the polynomial-time hierarchy
SIAM Journal on Computing
Polynomial-time 1-Turing reductions from #PH to #P
Theoretical Computer Science
On the structure of bounded queries to arbitrary NP sets
SIAM Journal on Computing
Terse, superterse, and verbose sets
Information and Computation
Using self-reducibilities to characterize polynomial time
Information and Computation
Quantifying the amount of verboseness
Information and Computation
The global power of additional queries to random oracles
Information and Computation
Information and Computation
Polynomial-time Membership Comparable Sets
SIAM Journal on Computing
Theoretical Computer Science
Quasi-linear truth-table reductions to p-selective sets
Theoretical Computer Science
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Theory of Semi-Feasible Algorithms
Theory of Semi-Feasible Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection
SIAM Journal on Computing
The Global Power of Additional Queries to P-Random Oracles
SIAM Journal on Computing
Counting, Selecting, adn Sorting by Query-Bounded Machines
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
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth 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
A theorem on probabilistic constant depth Computations
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Graph Theory With Applications
Graph Theory With Applications
Extending downward collapse from 1-versus-2 queries to j-versus-j + 1 queries
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Hi-index | 0.00 |
Let A(x) be the characteristic function of A. Consider the function CkA(x1,...,xk) = A(x1)...A(xk). We show that if CkA can be computed in polynomial time with fewer than k queries to some set X then A ∈ P/poly. A generalization of this result has applications to bounded query classes, circuits, and enumerability. In particular we obtain the following. (1) Assuming Σ3p ≠ Φ3p, there are functions computable using f(n) + 1 queries to SAT that are not computable using f(n) queries to SAT, for f(n) = O(log n). (2) If CkA, restricted to length n inputs, can be computed by an unbounded fanin oracle circuit of size s(n) and depth d(n), with k - 1 queries to some set X, then A can be computed with an unbounded fanin (non-oracle) circuit of size nO(k) s(n) and depth d(n) + O(1). (3) Assuming that PH ≠ Σ4p ∩ Φ4p, and ε 1, #SAT is not 2nε-enumerable.