Boolean Matrix Multiplication Hypothesis (BMM Hypothesis)
Jump to navigation
Jump to search
Target Problem
Description
Any combinatorial BMM algorithm requires $n^{3-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 Page 17