Splitting NP-Complete Sets

We show that a set is m-autoreducible if and only if it is m-mitotic. This solves a long-standing open question in a surprising way. As a consequence of this unconditional result and recent work by Glaßer et al., complete sets for all of the following complexity classes are m-mitotic: $\mathrm{NP}$,...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	SIAM journal on computing Jg. 37; H. 5; S. 1517 - 1535
Hauptverfasser:	Glaßer, Christian, Pavan, A., Selman, Alan L., Zhang, Liyu
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Philadelphia, PA Society for Industrial and Applied Mathematics 01.01.2008
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Computer science Computer science; control theory; systems Exact sciences and technology Logic and foundations Mathematical logic, foundations, set theory Mathematics Miscellaneous Recursion theory Sciences and techniques of general use Theoretical computing Polynomial 68Q15 NP-complete sets mitoticity; 68Q17 Complexity class autoreducibility Reducibility Redundancy Complexity Polynomial time computational and structural complexity Splitting Equivalence Sparse set
ISSN:	0097-5397, 1095-7111
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!