Separating complexity classes related to Ω-decision trees

Citations of this article
Mendeley users who have this article in their library.
Get full text


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.




Damm, C., & Meinel, C. (1992). Separating complexity classes related to Ω-decision trees. Theoretical Computer Science, 106(2), 351–360.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free