$\delta$-Triangle Conjecture
Jump to navigation
Jump to search
Target Problem
Description
Any Algorithm requires $m^{1+\delta-o(1)}$ time in expectation to detect whether an $m$ edge graph contains a triangle
Implies the following Hypothesis
Implied by the following Hypothesis
Computation Model
Word-Ram on $\log(n)$ bit words
Proven?
No