DocumentCode :
2200814
Title :
P-selective self-reducibles sets: a new characterization of P
Author :
Buhrman, Hany ; Van Helden, Peter ; Torenvliet, Leen
Author_Institution :
Dept. of Math. & Comput. Sci., Amsterdam Univ., Netherlands
fYear :
1993
fDate :
18-21 May 1993
Firstpage :
44
Lastpage :
51
Abstract :
It is shown that any p-selective and self-reducible sets is in P. As the converse is also true, the authors obtain a new characterization of the class P. A generalization and several consequences of this theorem are discussed. Among other consequences, it is shown that under reasonable assumptions autoreducibility and self-reducibility differ on NP, and there are non-p-T-mitotic sets in NP
Keywords :
computational complexity; P-selective self-reducibles sets; autoreducibility; self-reducibility; Automatic testing; Circuits; Complexity theory; Computer science; Game theory; Mathematics; Polynomials; TV; Turing machines;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Structure in Complexity Theory Conference, 1993., Proceedings of the Eighth Annual
Conference_Location :
San Diego, CA
Print_ISBN :
0-8186-4070-7
Type :
conf
DOI :
10.1109/SCT.1993.336542
Filename :
336542
Link To Document :
بازگشت