## Mitotic Classes in Inductive Inference

- Sanjay Jain, Frank Stephan
- SIAM J. Comput.
- 2008

2 Excerpts

- Published 2006 in TAMC

This expository paper describes some of the results of two recent research papers [GOP05,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.

@inproceedings{Glaer2006MitosisIC,
title={Mitosis in Computational Complexity},
author={Christian Gla\sser and Aduri Pavan and Alan L. Selman and Liyu Zhang},
booktitle={TAMC},
year={2006}
}