Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

TCS
2002

favoriteEmaildiscussreport

94views Theoretical Computer Science» more TCS 2002»

Complexity measures and decision tree complexity: a survey

13 years 4 months ago

Complexity measures and decision tree complexity: a survey

Download homepages.cwi.nl

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.

Harry Buhrman, Ronald de Wolf

Real-time Traffic

Boolean Functions | Complexity Measures | Decision Tree Complexity | TCS 2002 | Theoretical Computer Science |

claim paper

Related Content

» Occams Razor and a NonSyntactic Measure of Decision Tree Complexity

» Lower Bounds Using Kolmogorov Complexity

» Generating Better Decision Trees

» A Comparison of Prediction Accuracy Complexity and Training Time of ThirtyThree Old and Ne...

» Improved bounds for the randomized decision tree complexity of recursive majority

» Visualization of LargeScale Customer Satisfaction Surveys Using a Parallel Coordinate Tree

» Reduced Complexity Sphere Decoding for Square QAM via a New Lattice Representation

» Randomized vsDeterministic Decision Tree Complexity for ReadOnce Boolean Functions

» Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity

Post Info
More Details (n/a)

Added	23 Dec 2010
Updated	23 Dec 2010
Type	Journal
Year	2002
Where	TCS
Authors	Harry Buhrman, Ronald de Wolf

Comments (0)