The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Faster integer multiplication
Abstract
For more than 35 years, the fastest known method for integer multiplication has been the Schönhage-Strassen algorithm running in time O(n log n log log n). Under certain restrictive conditions there is a corresponding Ω(n log n) lower bound. The prevailing conjecture has always been that the complexity of an optimal algorithm is Θ(n log n). We present a major step towards closing the gap from above by presenting an algorithm running in time n log n, 2O(log* n).
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
Cites
An algorithm for the machine calculation of complex Fourier series
Cooley, J. W., & Tukey, J. W. (1965) · Mathematics of Computation · doi:10.1090/s0025-5718-1965-0178586-1 · Cited by 13,154
Schnelle Multiplikation großer Zahlen
Schönhage, A., & Strassen, V. (1971) · Computing · doi:10.1007/bf02242355 · Cited by 1,107
A modified split-radix fft with fewer arithmetic operations
Johnson, S. G., & Frigo, M. (2007) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2006.882087 · Cited by 380
Cited by
Most Tensor Problems Are NP-Hard
Hillar, C. J., & Lim, L.-H. (2013) · Journal of the ACM · doi:10.1145/2512329 · Cited by 1,099
Set Partitioning via Inclusion-Exclusion
Björklund, A., Husfeldt, T., & Koivisto, M. (2009) · SIAM Journal on Computing · doi:10.1137/070683933 · Cited by 370
Moore, C., & Mertens, S. (2011) · doi:10.1093/acprof:oso/9780199233212.001.0001 · Cited by 347
Brent, R. P., & Zimmermann, P. (2010) · Cambridge University Press eBooks · doi:10.1017/cbo9780511921698 · Cited by 321
Factoring with n+2 clean qubits and n-1 dirty qubits
Gidney, C. (2017) · arXiv · doi:10.48550/arxiv.1706.07884 · Cited by 28
Metadata
- Authors
- Fürer, M.
- Venue
- Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
- Publisher
- ACM
- Published
- 2007-06-11
- Pages
- 57-66
- OpenAlex
- W2170835539
- Cited by
- 240
- References
- 3
- FWCI
- 18.87
- Type
- conference paper
- Language
- en
- 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: Faster integer multiplication. https://app.cochat.ai/papers/10.1145/1250790.1250800
- The paper
- Fürer, M. (2007). Faster integer multiplication. Proceedings of the thirty-ninth annual ACM symposium on Theory of computing. https://doi.org/10.1145/1250790.1250800
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.