NP is as easy as detecting unique solutions
Theoretical Computer Science
Structural complexity 1
Query-limited reducibilities
Structural complexity 2
On truth-table reducibility to SAT
Information and Computation
SIAM Journal on Computing
On polynomial-time bounded truth-table reducibility of NP sets to sparse sets
SIAM Journal on Computing
SIAM Journal on Computing
PP is as hard as the polynomial-time hierarchy
SIAM Journal on Computing
Terse, superterse, and verbose sets
Information and Computation
On reductions of NP sets to sparse sets
Journal of Computer and System Sciences
Computing functions with parallel queries to NP
Theoretical Computer Science
Quantifying the amount of verboseness
Information and Computation
Information and Computation
Polynomial-time Membership Comparable Sets
SIAM Journal on Computing
Relativized isomorphisms of NP-complete sets
Computational Complexity
Quasi-linear truth-table reductions to p-selective sets
Theoretical Computer Science
On resource-bounded instance complexity
Theoretical Computer Science
Oracles and queries that are sufficient for exact learning
Journal of Computer and System Sciences
P-selective self-reducible sets: a new characterization of P
Journal of Computer and System Sciences
The complexity of obtaining solutions for problems in NP and NL
Complexity theory retrospective II
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
New Collapse Consequences of NP Having Small Circuits
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Counting, Selecting, adn Sorting by Query-Bounded Machines
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
On the Existence of Hard Sparse Sets under Weak Reductions
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
The Complexity of Generating and Checking Proffs of Membership
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Resource-Bounded Kolmogorov Complexity Revisited
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
Some connections between nonuniform and uniform complexity classes
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
NP might not be as easy as detecting unique solutions
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On the complexity of data disjunctions
Theoretical Computer Science - Complexity and logic
Sparse sets, approximable sets, and parallel queries to NP
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Online learning and resource-bounded dimension: winnow yields new lower bounds for hard sets
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
| Hi-index | 0.00 |
We consider the following six hypotheses: - P = NP - SAT is truth-table reducible to a P-selective set - SAT is truth-table reducible to a k-approximable set for some k. - FP with parallel queries to SAT is equivalent to FP with O(log n) adaptive queries to SAT - SAT is O(log n)-approximable - Solving SAT is in P on formula with at most one assignment. We discuss the importance and relationships among them.