Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 193

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

Algebraic complexity theory and matrix multiplication

Open access
Le Gall, François·2014·Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation

Abstract

This tutorial will give an overview of algebraic complexity theory focused on bilinear complexity, and describe several powerful techniques to analyze the complexity of computational problems from linear algebra, in particular matrix multiplication. The presentation of these techniques will follow the history of progress on constructing asymptotically fast algorithms for matrix multiplication, and include its most recent developments.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/2608628.2627493

Cites

3 of 3 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 3 references

Cited by

See all 193

Metadata

Authors
Le Gall, F.
Venue
Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation
Publisher
ACM
Published
2014-07-23
Pages
23-23
OpenAlex
W2094090625
Cited by
193
References
3
Type
conference abstract
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Algebraic complexity theory and matrix multiplication. https://app.cochat.ai/papers/10.1145/2608628.2627493
The paper
Le Gall, F. (2014). Algebraic complexity theory and matrix multiplication. Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation. https://doi.org/10.1145/2608628.2627493

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.