K-Clique Hypothesis
Jump to navigation
Jump to search
Target Problem
[[$k$-Clique for all $k > 0$]]
Description
No randomized algorithm can detect a $k$-Clique in an $n$-node graph in $O(n^{\omega k / 3 - \epsilon})$ time for any $\epsilon > 0$.
Implies the following Hypothesis
Implied by the following Hypothesis
Computation Model
Word-RAM on $\log(n)$ bit words
Proven?
No
Year
References/Citation
http://people.csail.mit.edu/virgi/eccentri.pdf Hypothesis 6