Exact k-Clique Hypothesis
Revision as of 10:30, 15 February 2023 by Admin (talk | contribs) (Created page with "== Target Problem == Exact $k$-Clique == Description == The Exact $k$-Clique problem on $n$ node graphs with edge weights in $\{-n^{100k},\ldots,n^{100k}\}$ requires (randomized) $n^{k-o(1)}$ time. == Implies the following Hypothesis == OVH == Implied by the following Hypothesis == == Computation Model == Word-Ram on $\log(n)$ bit words == Proven? == No == Year == == References/Citation == http://people...")
Target Problem
Description
The Exact $k$-Clique problem on $n$ node graphs with edge weights in $\{-n^{100k},\ldots,n^{100k}\}$ requires (randomized) $n^{k-o(1)}$ time.
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.ezproxy.canberra.edu.au/virgi/eccentri.pdf Hypothesis 8