# K-Clique Hypothesis

Revision as of 10:30, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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 Hypothe...")

## 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