Document Type
Article
Publication Date
8-2007
Abstract
We show the following results regarding complete sets. • NP-complete sets and PSPACE-complete sets are polynomial-time many–one autoreducible.
• Complete sets of any level of PH, MODPH, or the Boolean hierarchy over NP are polynomial-time many–one autoreducible.
• EXP-complete sets are polynomial-time many–one mitotic.
• If there is a tally language in NP ∩ coNP − P , then, for every ϵ > 0 , NP-complete sets are not 2 n ( 1 + ϵ ) -immune.
These results solve several of the open questions raised by Buhrman and Torenvliet in their 1994 survey paper on the structure of complete sets.
Recommended Citation
Glaßer, Christian, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, and Liyu Zhang. "Autoreducibility, mitoticity, and immunity." Journal of Computer and System Sciences 73, no. 5 (2007): 735-754. https://doi.org/10.1016/j.jcss.2006.10.020
Publication Title
Journal of Computer and System Sciences
DOI
10.1016/j.jcss.2006.10.020
Comments
Original published version available at https://doi.org/10.1016/j.jcss.2006.10.020