Complexity measures and decision tree complexity: a survey
Theoretical Computer Science - Complexity and logic
| Hi-index | 0.00 |
A new complexity measure for Boolean functions is introduced in this article. It has a link to the query algorithms: it stands between both polynomial degree and non-deterministic complexity on one hand and still is a lower bound for deterministic complexity. Some inequalities and counterexamples are presented and usage in symmetrisation polynomials is considered.