Summary: Mitosis in Computational Complexity
, A. Pavan2
, Alan L. Selman3
, and Liyu Zhang4
Universit¨at W¨urzburg, firstname.lastname@example.org
Iowa State University, email@example.com
University at Buffalo, firstname.lastname@example.org
University at Buffalo, email@example.com
Abstract. This expository paper describes some of the results of two re-
cent research papers [GOP+
05,GPSZ05]. The first of these papers proves
that every NP-complete set is many-one autoreducible. The second pa-
per 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