3 search results - page 1 / 1 » Extremal Bipartite Graphs and Superpolynomial Lower Bounds f... |
STOC
1996
ACM
13 years 11 months ago
1996
ACM
COMBINATORICA
1999
13 years 7 months ago
1999
ICALP
2001
Springer
14 years 1 days ago
2001
Springer
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...