• DocumentCode
    2362910
  • Title

    DSPACE(n)=?NSPACE(n): a degree theoretic characterization

  • Author

    Agrawal, Manindra

  • Author_Institution
    Sch. of Math., SPIC Sci. Foundation, Madras, India
  • fYear
    1995
  • fDate
    19-22 Jun 1995
  • Firstpage
    315
  • Lastpage
    323
  • Abstract
    It is shown that the following are equivalent: 1. DSPACE(n)=NSPACE(n). 2. There is a ⩽m1-NL-degree that coincides with a ⩽m1-L degree. 3. For every class C closed under logspace reductions the ⩽m1-NL-complete degree of C coincides with the ⩽m1-L-complete degree of C
  • Keywords
    computational complexity; DSPACE; NSPACE; degree theoretic characterization; logspace reductions; Complexity theory; Cryptography; Polynomials;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Structure in Complexity Theory Conference, 1995., Proceedings of Tenth Annual IEEE
  • Conference_Location
    Minneapolis, MN
  • ISSN
    1063-6870
  • Print_ISBN
    0-8186-7052-5
  • Type

    conf

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