The DOI matches its Crossref record.
Algebraic Complexity Theory
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.
Integrity signals
Registry
Cites
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.
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
Cited by
Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
de Silva, V., & Lim, L.-H. (2008) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/06066518x · Cited by 927
Multiplying matrices faster than coppersmith-winograd
Williams, V. V. (2012) · Proceedings of the forty-fourth annual ACM symposium on Theory of computing · doi:10.1145/2213977.2214056 · Cited by 850
Matrices: theory and applications
(2003) · Choice Reviews Online · doi:10.5860/choice.40-4658 · Cited by 648
Secure Multiparty Computation and Secret Sharing
Cramer, R., Damgård, I. B., & Nielsen, J. B. (2015) · doi:10.1017/cbo9781107337756 · Cited by 595
Tensor decompositions, alternating least squares and other tales
Comon, P., Luciani, X., & de Almeida, A. L. F. (2009) · Journal of Chemometrics · doi:10.1002/cem.1236 · Cited by 457
Metadata
- Authors
- Bürgisser, P., Clausen, M., & Shokrollahi, M. A.
- Venue
- Grundlehren der mathematischen Wissenschaften
- Publisher
- Springer Berlin Heidelberg
- Published
- 1997
- ISSN
- 0072-7830 (ISSN-L)
- OpenAlex
- W1561337879
- Cited by
- 1,026
- References
- 0
- FWCI
- 7.24
- Type
- book
- Language
- de
- Open access
- closed
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. https://app.cochat.ai/papers/10.1007/978-3-662-03338-8
- The paper
- Bürgisser, P., Clausen, M., & Shokrollahi, M. A. (1997). Algebraic Complexity Theory. Grundlehren der mathematischen Wissenschaften. https://doi.org/10.1007/978-3-662-03338-8
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.
