Separating completely complexity classes related to polynomial size Ω-Decision trees

This publication has 9 references indexed in Scilit:

• The power of polynomial size Ω-branching programs
  Published by Springer Nature ,2006
• Separating the eraser turing machine classes Le, NLe, co-NLe and Pe
  Published by Springer Nature ,2005
• On the complexity of branching programs and decision trees for clique functions
  Journal of the ACM, 1988
• Lower estimates of the dimension of schemes of bounded depth in the basis $ \{\&,\vee,\oplus\}$
  Russian Mathematical Surveys, 1986
• Two lower bounds for branching programs
  Published by Association for Computing Machinery (ACM) ,1986
• Almost optimal lower bounds for small depth circuits
  Published by Association for Computing Machinery (ACM) ,1986
• Separating the polynomial-time hierarchy by oracles
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1985
• Optimal decision trees and one-time-only branching programs for symmetric Boolean functions
  Information and Control, 1984
• Parity, circuits, and the polynomial-time hierarchy
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1981