• DocumentCode
    2200309
  • Title

    Alternating time versus deterministic time: a separation

  • Author

    Gupta, Sanjay

  • Author_Institution
    Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USA
  • fYear
    1993
  • fDate
    18-21 May 1993
  • Firstpage
    266
  • Lastpage
    277
  • Abstract
    It is shown that only two alternations are sufficient to achieve a log*t(n) speed-up of deterministic Turing machines. Using this speed-up it is shown that for each time-constructible function t(n), two alternations are strictly more powerful than deterministic time
  • Keywords
    Turing machines; computational complexity; deterministic automata; alternating time; deterministic Turing machines; deterministic time; time-constructible function; Complexity theory; Computational modeling; Legged locomotion; Polynomials; Turing machines;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Structure in Complexity Theory Conference, 1993., Proceedings of the Eighth Annual
  • Conference_Location
    San Diego, CA
  • Print_ISBN
    0-8186-4070-7
  • Type

    conf

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