Boolean Matrix Multiplication Hypothesis (BMM Hypothesis): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 10:3010:30, 15 February 2023‎ Admin talk contribs‎ 378 bytes +378‎ 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.ezproxy.canberra.edu.au/virgi/eccentri.pdf Page 17"
Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/wiki/Boolean_Matrix_Multiplication_Hypothesis_(BMM_Hypothesis)"