The complexity of promise problems with applications to public-key cryptography
Information and Control
NP is as easy as detecting unique solutions
Theoretical Computer Science
Information and Computation
A very hard log-space counting class
Theoretical Computer Science - Special issue on structure in complexity theory
Why is Boolean complexity theory difficult?
Poceedings of the London Mathematical Society symposium on Boolean function complexity
The graph isomorphism problem: its structural complexity
The graph isomorphism problem: its structural complexity
Reductions to sets of low information content
Complexity theory
On the nonuniform complexity of the graph isomorphism problem
Complexity theory
Information and Computation
Polynomial-time Membership Comparable Sets
SIAM Journal on Computing
Theoretical Computer Science
Symmetric logspace is closed under complement
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Quasi-linear truth-table reductions to p-selective sets
Theoretical Computer Science
Computing Solutions Uniquely Collapses the Polynomial Hierarchy
SIAM Journal on Computing
P-selective self-reducible sets: a new characterization of P
Journal of Computer and System Sciences
A note on decision versus search for graph automorphism
Information and Computation
Deterministic and randomized bounded truth-table reductions of P, NL, and L to sparse sets
Journal of Computer and System Sciences - Eleventh annual conference on structure and complexity 1996
Journal of Computer and System Sciences
A structural property of regular frequency computations
Theoretical Computer Science
Cryptocomplexity and NP-Completeness
Proceedings of the 7th Colloquium on Automata, Languages and Programming
On Reachability in Graphs with Bounded Independence Number
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Some connections between nonuniform and uniform complexity classes
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Separating NE from Some Nonuniform Nondeterministic Complexity Classes
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Separating NE from some nonuniform nondeterministic complexity classes
Journal of Combinatorial Optimization
Hi-index | 0.00 |
This paper studies for various natural problems in NP whether they can be reduced to sets with low information content, such as branches, P-selective sets, and membership comparable sets. The problems that are studied include the satisfiability problem, the graph automorphism problem, the undirected graph accessibility problem, the determinant function, and all logspace self-reducible languages. Some of these are complete for complexity classes within NP, but for others an exact complexity theoretic characterization is not known. Reducibility of these problems is studied in a general framework introduced in this paper: prover-verifier protocols with low-complexity provers. It is shown that all these natural problems indeed have such protocols. This fact is used to show, for certain reduction types, that these problems are not reducible to sets with low information content unless their complexity is much less than what it is currently believed to be. The general framework is also used to obtain a new characterization of the complexity class L : L is the class of all logspace self-reducible sets in LL-sel.