Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Mitosis in Computational Complexity Christian Glaer1
 

Summary: Mitosis in Computational Complexity
Christian Glaßer1
, A. Pavan2
, Alan L. Selman3
, and Liyu Zhang4
1
Universit¨at W¨urzburg, glasser@informatik.uni-wuerzburg.de
2
Iowa State University, pavan@cs.iastate.edu
3
University at Buffalo, selman@cse.buffalo.edu
4
University at Buffalo, lzhang7@cse.buffalo.edu
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

  

Source: Aduri, Pavan - Department of Computer Science, Iowa State University
Zhang, Liyu - Computer and Information Sciences Department, University of Texas at Brownsville

 

Collections: Computer Technologies and Information Sciences