On the Structure of Polynomial Time Reducibility
Journal of the ACM (JACM)
NP-complete decision problems for quadratic polynomials
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Computational complexity of probabilistic Turing machines
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Some polynomial and integer divisibility problems are NP-HARD
SFCS '76 Proceedings of the 17th Annual Symposium on Foundations of Computer Science
NP is as easy as detecting unique solutions
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Zero-knowledge simulation of Boolean circuits
Proceedings on Advances in cryptology---CRYPTO '86
Hard-core theorems for complexity classes
Journal of the ACM (JACM)
Relativized Questions Involving Probabilistic Algorithms
Journal of the ACM (JACM)
Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs
Journal of the ACM (JACM)
The General Notion of a Dot-Operator
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Relativized questions involving probabilistic algorithms
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
On &ggr;-reducibility versus polynomial time many-one reducibility(Extended Abstract)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
On the distribution of independent formulae of number theory
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
The impact of complexity theory on algorithms for sparse polynomials
ACM SIGSAM Bulletin
Comparing reductions to NP-complete sets
Information and Computation
The Computational Complexity of Ideal Semantics I: Abstract Argumentation Frameworks
Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008
The computational complexity of ideal semantics
Artificial Intelligence
Strong reductions and isomorphism of complete sets
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Comparing reductions to NP-complete sets
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
A thirty year old conjecture about promise problems
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |
The method of showing a problem NP-complete by polynomial reduction is one of the most elegant and productive in our theory ([ 1 ], [ 3 ]). It is a means of providing compelling evidence that a problem in NP is not in P. In this paper we will demonstrate new methods for showing this. Our methods, based on a new notion of reducibility (gamma-reducibility) are apparently of more general applicability than that of polynomial reduction and are intended to be of practical value to researchers in the field. We use our methods to “demonstrate” (i.e., give compelling evidence) that some natural problems in NP which are not known to be NP-complete are, nonetheless, not in P.