DocumentCode
3151873
Title
Some properties of exponential time complexity classes
Author
Fu, Bin ; Li, Hong-zhou ; Zhong, Yong
Author_Institution
Beijing Comput. Inst., China
fYear
1992
fDate
22-25 Jun 1992
Firstpage
50
Lastpage
57
Abstract
The authors separate NE from Px (NP), where x = n 0(1)-T . The class EXP-low[1] is introduced and applied in the investigations of stable properties for both EXP and NEXP hard sets. A set A is in EXP-low[1](EXP-low resp.) if EXP A[1]=EXP(EXPA=EXP). The authors separate EXP-low[1] from EXP-low by constructing a set A such that EXP A[1]=EXP and EXPA=EXPEXP
Keywords
computational complexity; EXP hard sets; EXP-low[1]; NE; NEXP hard sets; NP; exponential time complexity classes; stable properties; Automation; Computer industry; Computer science education; Educational institutions; Home computing; Laboratories; Mathematics; Metals industry; Polynomials; Stability;
fLanguage
English
Publisher
ieee
Conference_Titel
Structure in Complexity Theory Conference, 1992., Proceedings of the Seventh Annual
Conference_Location
Boston, MA
Print_ISBN
0-8186-2955-X
Type
conf
DOI
10.1109/SCT.1992.215380
Filename
215380
Link To Document