DocumentCode :
3242819
Title :
Separation of NP-completeness notions
Author :
Pavan, A. ; Selman, Alan L.
Author_Institution :
Dept. of Comput. Sci. & Eng., State Univ. of New York, Buffalo, NY, USA
fYear :
2001
fDate :
2001
Firstpage :
78
Lastpage :
89
Abstract :
We use hypotheses of structural complexity theory to separate various NP-completeness notions. In particular, we introduce a hypothesis from which we describe a set in NP that is ⩽T P-complete but not ⩽ttP-complete. We provide fairly thorough analyses of the hypotheses that we introduce
Keywords :
computational complexity; NP-completeness notion separation; structural complexity theory; Computer science; NP-complete problem; Polynomials; Turing machines;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computational Complexity, 16th Annual IEEE Conference on, 2001.
Conference_Location :
Chicago, IL
Print_ISBN :
0-7695-1053-1
Type :
conf
DOI :
10.1109/CCC.2001.933875
Filename :
933875
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=3242819
بازگشت