3 search results - page 1 / 1 » The Monotone Complexity of k-clique on Random Graphs |
FOCS
2010
IEEE
13 years 2 months ago
2010
IEEE
It is widely suspected that Erdos-R
ICALP
2001
Springer
13 years 9 months 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...
DCG
2011
12 years 11 months ago
2011
We study the expected topological properties of ˇCech and Vietoris-Rips complexes built on random points in Rd . We find higher dimensional analogues of known results for connect...