Separating complexity classes related to Ω-decision trees

  • Damm C
  • Meinel C
  • 1


    Mendeley users who have this article in their library.
  • 0


    Citations of this article.


By proving exponential lower and polynomial upper bounds for parity decision trees and collecting similar bounds for nondeterministic and co-nondeterministic decision trees, the complexity classes related to polynomial-size deterministic, nondeterministic, co-nondeterministic, parity, and alternating decision trees are completely separated. Considering alternating decision trees, it is shown that the number of alternations between, say, {curly logical or}-nodes and {curly logical and}-nodes strongly influences their computational power. © 1992.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Carsten Damm

  • Christoph Meinel

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free