Home >  Term: polynomial hierarchy
polynomial hierarchy

The classes of languages accepted by k-alternating Turing machines, over all k≥ 0 and with initial state existential or universal. The bottom level (k=0) is the class P. The next level (k=1) comprises NP and co- NP.

0 0

Kūrėjas

  • GeorgeV
  •  (Gold) 1123 points
  • 100% positive feedback
© 2024 CSOFT International, Ltd.