Sciweavers

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

16

FOCS
2010
IEEE

favoriteEmaildiscussreport

135views Theoretical Computer Science» more FOCS 2010»

The Monotone Complexity of k-clique on Random Graphs

13 years 2 months ago

The Monotone Complexity of k-clique on Random Graphs

Download www.mit.edu

It is widely suspected that Erdos-R

Benjamin Rossman

Real-time Traffic

Far-apart Threshold Functions | FOCS 2010 | K-clique Problem | Monotone Circuit | Theoretical Computer Science |

claim paper

Related Content

» Improved Lower Bounds on the Randomized Complexity of Graph Properties

» Random Geometric Complexes

Post Info
More Details (n/a)

Added	11 Feb 2011
Updated	11 Feb 2011
Type	Journal
Year	2010
Where	FOCS
Authors	Benjamin Rossman

Comments (0)