Lower Bounds for Matrix Product: 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.

24 December 2023

  • curprev 03:4803:48, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,264 bytes +1,264‎ Created page with "Title: Lower Bounds for Matrix Product Research Question: Can matrix product be computed by a circuit of size O(n2)? Methodology: The researchers used the model of arithmetic circuits, which is the most general model for computing polynomial functions. They considered two other models: quadratic circuits and bilinear circuits. In these models, product gates are applied only on two linear functions. Results: The researchers proved lower bounds on the number of product..."
Retrieved from "https://simplesci.org/wiki/Lower_Bounds_for_Matrix_Product"