NP is as easy as detecting unique solutions
Theoretical Computer Science
Designing programs that check their work
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On polynomial-time bounded truth-table reducibility of NP sets to sparse sets
SIAM Journal on Computing
On the hardness of computing the permanent of random matrices (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Complete problems and strong polynomial reducibilities
SIAM Journal on Computing
Highly resilient correctors for polynomials
Information Processing Letters
Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Journal of the ACM (JACM)
On being incoherent without being very hard
Computational Complexity
Information and Computation
Polynomial-time Membership Comparable Sets
SIAM Journal on Computing
Quasi-linear truth-table reductions to p-selective sets
Theoretical Computer Science
Chinese remaindering with errors
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Separating Complexity Classes Using Autoreducibility
SIAM Journal on Computing
Proceedings of the Symposium "Rekursive Kombinatorik" on Logic and Machines: Decision Problems and Complexity
Pseudorandomness and Average-Case Complexity via Uniform Reductions
CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
Polynomial reducibilities and complete sets.
Polynomial reducibilities and complete sets.
The cpa's responsibility for the prevention and detection of computer fraud.
The cpa's responsibility for the prevention and detection of computer fraud.
Autoreducibility, mitoticity, and immunity
Journal of Computer and System Sciences
SIAM Journal on Computing
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Proof verification and hardness of approximation problems
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Theoretical Computer Science
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
The dot-depth and the polynomial hierarchy correspond on the delta levels
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
| Hi-index | 0.00 |
Autoreducibility and mitoticity express weak forms of redundancy of information that a set might possess. We describe many results known about these concepts. Mitoticity always implies autoreducibility, but the converse holds in some situations and fails in others. Among the results we describe are that NP-complete sets are many-one autoreducible and that every many-one autoreducible set is many-one mitotic. In particular, every infinite NPcomplete set splits by a set in P into two disjoint, infinite NP-complete set.