• DocumentCode
    2517726
  • Title

    Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines

  • Author

    Krause, Matthias ; Meinel, Christoph ; Waack, Stephan

  • Author_Institution
    Sektion Math., Humboldt Univ., Berlin, East Germany
  • fYear
    1989
  • fDate
    19-22 Jun 1989
  • Firstpage
    240
  • Lastpage
    249
  • Abstract
    It is proved that oblivious simultaneously linear access-time and logarithmic space-bounded nondeterministic Turing machines are more powerful than deterministic ones. All the corresponding complexity classes are separated from each other
  • Keywords
    Turing machines; computational complexity; complexity classes; input oblivious logarithmic space-bounded Turing machines; linear access-time; Binary decision diagrams; Complexity theory; Microwave integrated circuits; Polynomials; Turing machines; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Structure in Complexity Theory Conference, 1989. Proceedings., Fourth Annual
  • Conference_Location
    Eugene, OR
  • Print_ISBN
    0-8186-1958-9
  • Type

    conf

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