Boolean Matrix Multiplication Hypothesis (BMM Hypothesis)

From Algorithm Wiki
Revision as of 10:30, 15 February 2023 by Admin (talk | contribs) (Created page with "== Target Problem == BMM == 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/virgi/eccentri.pdf Page 17")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Target Problem

BMM

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/virgi/eccentri.pdf Page 17

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Boolean_Matrix_Multiplication_Hypothesis_(BMM_Hypothesis)&oldid=44342"