The critical complexity of all (monotone) Boolean functions and monotone graph properties
Information and Control
Complexity measures and decision tree complexity: a survey
Theoretical Computer Science - Complexity and logic
Query strategies for priced information
Journal of Computer and System Sciences - Special issue on STOC 2000
A new strategy for querying priced information
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Counting the number of vertex covers in a trapezoid graph
Information Processing Letters
Hi-index | 0.89 |
For the class of monotone boolean functions f:{0,1}^n-{0,1} where all 1-certificates have size 2, we prove the tight bound n=