Complexity measures and decision tree complexity: a survey

We discuss several complexity measures for Boolean functions: certi cate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. We survey the relations and biggest gaps known between these measures, and show how they give bounds for the decision tree complexity of Boolean functions on deterministic, randomized, and quantum computers.

• Type: Journal
• Year: 2002
• Where: TCS
• Authors: Harry Buhrman, Ronald de Wolf
• Keywords: Boolean Functions, Complexity Measures, Decision Tree Complexity, TCS 2002, Theoretical Computer Science