• DocumentCode
    3359909
  • Title

    Exponential time and subexponential time sets

  • Author

    TANG, Shouwen ; Fu, Bin ; Liu, Tian

  • Author_Institution
    Beijing Computer Inst., China
  • fYear
    1991
  • fDate
    30 Jun-3 Jul 1991
  • Firstpage
    230
  • Lastpage
    237
  • Abstract
    The authors prove that the symmetric difference of a ⩽P k-parity-hard set for E and a subexponential time computable set is still ⩽Pk-parity-hard for E. This remains true for a ⩽Pm-hard set for E since 1-parity reduction is many-one reduction. In addition, it is shown that it is not the case with respect to some other types of reductions. The authors introduce and study the notions of E-complete and E-hard kernels
  • Keywords
    computational complexity; set theory; 1-parity reduction; exponential time sets; many-one reduction; subexponential time sets; symmetric difference; Cognitive science; Home computing; Kernel; Laboratories; Polynomials;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Structure in Complexity Theory Conference, 1991., Proceedings of the Sixth Annual
  • Conference_Location
    Chicago, IL
  • Print_ISBN
    0-8186-2255-5
  • Type

    conf

  • DOI
    10.1109/SCT.1991.160265
  • Filename
    160265
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3359909