Mitosis in computational complexity

Authors:
Christian Glaßer;A. Pavan;Alan L. Selman;Liyu Zhang
Affiliations:
Universität Würzburg;Iowa State University;University at Buffalo;University at Buffalo
Venue:
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Year:
2006

Citing 7
Cited 1

Coherent functions and program checkers

STOC '90 Proceedings of the twenty-second 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 being incoherent without being very hard

Computational Complexity
Splittings, Robustness, and Structure of Complete Sets

SIAM Journal on Computing
Separating Complexity Classes Using Autoreducibility

SIAM Journal on Computing
P-mitotic sets

Proceedings of the Symposium "Rekursive Kombinatorik" on Logic and Machines: Decision Problems and Complexity
Autoreducibility, mitoticity, and immunity

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science

Mitotic classes

COLT'07 Proceedings of the 20th annual conference on Learning theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

This expository paper describes some of the results of two recent research papers [GOP+05, GPSZ05]. The first of these papers proves that every NP-complete set is many-one autoreducible. The second paper proves that every many-one autoreducible set is many-one mitotic. It follows immediately that every NP-complete set is many-one mitotic. Hence, we have the compelling result that every NP-complete set A splits into two NP-complete sets A1 and A2.