• DocumentCode
    3256472
  • Title

    Nondeterministic and alternating computations

  • Author

    Wang, Jie ; Longpré, Luc

  • Author_Institution
    Wilkes Univ., PA, USA
  • fYear
    1992
  • fDate
    28-30 May 1992
  • Firstpage
    88
  • Lastpage
    91
  • Abstract
    This paper proves that alternating computations with O( t(n)) time can simulate nondeterministic computations with O(t(n) log* t(n)) time and O(t(n)) nondeterministic moves. From this the authors prove that nondeterministic linear time is not closed under complementation if nondeterministic Turing machines with O(n log* n) time and linear nondeterministic moves are strictly more powerful than nondeterministic linear time
  • Keywords
    Turing machines; computational complexity; alternating computations; complexity classes; nondeterministic Turing machines; nondeterministic computations; nondeterministic linear time; Complexity theory; Computational modeling; Computer science; Ear; Educational institutions; Internet; Legged locomotion; Magnetic heads; Turing machines;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computing and Information, 1992. Proceedings. ICCI '92., Fourth International Conference on
  • Conference_Location
    Toronto, Ont.
  • Print_ISBN
    0-8186-2812-X
  • Type

    conf

  • DOI
    10.1109/ICCI.1992.227698
  • Filename
    227698
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3256472