The DOI matches its Crossref record; 7 of the 8 references it cites were found in a registry or an index.
Matrix multiplication via arithmetic progressions
Open accessOverview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“With the use of the Coppersmith-Winograd algorithm, the time complexity of both the KF-based algorithms can be reduced from O ( m 3 ) to O ( m 2 . 375 ) .”
From Real-Time Performance Assessment of High-Order Tremor Estimators Used in a Wearable Tremor Suppression Device (2022) · cites this paper as [41]
In the citing paper
“Therefore, to reduce the time complexity of the KFbased algorithms, a Coppersmith-Winograd algorithm [41] can be used to optimize the matrix operation.”
From Real-Time Performance Assessment of High-Order Tremor Estimators Used in a Wearable Tremor Suppression Device (2022) · cites this paper as [41]
In the citing paper
“It was identified that the use of a Coppersmith-Winograd algorithm can largely reduce the time complexity of the KFbased algorithm to a similar level as the BMFLC.”
From Real-Time Performance Assessment of High-Order Tremor Estimators Used in a Wearable Tremor Suppression Device (2022) · cites this paper as [41]
Citations
Cites
On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
Behrend, F. A. (1946) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.32.12.331 · Cited by 414
Partial and Total Matrix Multiplication
Schönhage, A. (1981) · SIAM Journal on Computing · doi:10.1137/0210032 · Cited by 279
On the Asymptotic Complexity of Matrix Multiplication
Coppersmith, D., & Winograd, S. (1982) · SIAM Journal on Computing · doi:10.1137/0211038 · Cited by 221
Self-citationHow to Multiply Matrices Faster
(1984) · Lecture notes in computer science · doi:10.1007/3-540-13866-8 · Cited by 147
On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
Salem, R., & Spencer, D. C. (1942) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.28.12.561 · Cited by 134
Pan, V. Y. (1978) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1978.34 · Cited by 121
The asymptotic spectrum of tensors and the exponent of matrix multiplication
Strassen, V. (1986) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1986.52 · Cited by 120
Cited by
Sorted by citations
Items 201–300 of 1,001
About the XL Algorithm over GF(2)
Courtois, N. T., & Patarin, J. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36563-x_10 · Cited by 91
Asymptotically fast computation of Hermite normal forms of integer matrices
Storjohann, A., & Labahn, G. (1996) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/236869.237083 · Cited by 91
Cross-Dataset Activity Recognition via Adaptive Spatial-Temporal Transfer Learning
Qin, X., Chen, Y., Wang, J., & Yu, C. (2019) · Proceedings of the ACM on Interactive Mobile Wearable and Ubiquitous Technologies · doi:10.1145/3369818 · Cited by 90
Bostan, A., Gaudry, P., & Schost, É. (2007) · SIAM Journal on Computing · doi:10.1137/s0097539704443793 · Cited by 95
New Algorithm for Ordered Tree-to-Tree Correction Problem
Chen, W. (2001) · Journal of Algorithms · doi:10.1006/jagm.2001.1170 · Cited by 93
On cap sets and the group-theoretic approach to matrix multiplication
Blasiak, J., Church, T., Cohn, H., Grochow, J. A., Naslund, E., Sawin, W. F., & Umans, C. (2017) · Discrete Analysis · doi:10.19086/da.1245 · Cited by 110
Fully dynamic transitive closure: breaking through the O(n/sup 2/) barrier
Demetrescu, C., & Italiano, G. F. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892126 · Cited by 89
A New Algorithm for Optimal Constraint Satisfaction and Its Implications
Williams, R. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-27836-8_101 · Cited by 88
Complexity of Computations with Matrices and Polynomials
Pan, V. Y. (1992) · SIAM Review · doi:10.1137/1034049 · Cited by 89
Efficient algorithms for large-scale local triangle counting
Becchetti, L., Boldi, P., Castillo, C., & Gionis, A. (2010) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1839490.1839494 · Cited by 87
On the possibility of faster SAT algorithms
Pǎtraşcu, M., & Williams, R. (2010) · ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611973075.86 · Cited by 87
Processor efficient parallel solution of linear systems over an abstract field
Kaltofen, E., & Pan, V. Y. (1991) · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · doi:10.1145/113379.113396 · Cited by 87
All pairs shortest paths in weighted directed graphs-exact and almost exact algorithms
Zwick, U. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1998.743464 · Cited by 87
Radio Frequency Fingerprinting on the Edge
Jian, T., Gong, Y., Zhan, Z., Shi, R., Soltani, N., Wang, Z., Dy, J., Chowdhury, K. R., Wang, Y., & Ioannidis, S. (2021) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2021.3064466 · Cited by 92
Open Problems Related to Algebraic Attacks on Stream Ciphers
Canteaut, A. (2006) · Lecture notes in computer science · doi:10.1007/11779360_10 · Cited by 86
Memory-Efficient Matrix Multiplication in the BSP Model
McColl, W. F., & Tiskin, A. (1999) · Algorithmica · doi:10.1007/pl00008264 · Cited by 92
Geroliminis, N., Kepaptsoglou, K. L., & Karlaftis, M. G. (2010) · European Journal of Operational Research · doi:10.1016/j.ejor.2010.08.031 · Cited by 86
A Co-Training Strategy for Multiple View Clustering in Process Mining
Appice, A., & Malerba, D. (2015) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2015.2430327 · Cited by 85
Algorithms for Exponentiation in Finite Fields
Gao, S., Gathen, J. V. Z., Panario, D., & Shoup, V. (2000) · Journal of Symbolic Computation · doi:10.1006/jsco.1999.0309 · Cited by 85
Yu, Q., & Avestimehr, A. S. (2020) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit44484.2020.9174167 · Cited by 89
Graph expansion and communication costs of fast matrix multiplication
Ballard, G., Demmel, J. W., Holtz, O., & Schwartz, O. (2012) · Journal of the ACM · doi:10.1145/2395116.2395121 · Cited by 90
Tsourakakis, C. E., Petros Drineas, B., Michelakis, E., Koutis, I., & Faloutsos, C. (2010) · Social Network Analysis and Mining · doi:10.1007/s13278-010-0001-9 · Cited by 83
Reducing the Servers’ Computation in Private Information Retrieval: PIR with Preprocessing
Beimel, A., Ishai, Y., & Malkin, T. (2004) · Journal of Cryptology · doi:10.1007/s00145-004-0134-y · Cited by 83
Faster Generation of Random Spanning Trees
Kelner, J. A., & Mądry, A. (2009) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2009.75 · Cited by 83
Space and Time Complexity of Exact Algorithms: Some Open Problems
Woeginger, G. J. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-28639-4_25 · Cited by 83
Fast Monte-Carlo algorithms for approximate matrix multiplication
Petros Drineas, B., & Kannan, R. (2001) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959921 · Cited by 85
Finding, Minimizing, and Counting Weighted Subgraphs
Williams, V. V., & Williams, R. (2013) · SIAM Journal on Computing · doi:10.1137/09076619x · Cited by 82
The shifted number system for fast linear algebra on integer matrices
Storjohann, A. (2005) · Journal of Complexity · doi:10.1016/j.jco.2005.04.002 · Cited by 86
Quantum computers that can be simulated classically in polynomial time
Valiant, L. G. (2001) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/380752.380785 · Cited by 89
Approximating Node Connectivity Problems via Set Covers
Kortsarz, G., & Nutov, Z. (2003) · Algorithmica · doi:10.1007/s00453-003-1027-4 · Cited by 81
Fishkind, D. E., Adali, S., Patsolic, H. G., Meng, L., Singh, D., Lyzinski, V., & Priebe, C. E. (2018) · Pattern Recognition · doi:10.1016/j.patcog.2018.09.014 · Cited by 80
On practical algorithms for accelerated matrix multiplication
Laderman, J. D., Pan, V. Y., & Sha, X.-H. (1992) · Linear Algebra and its Applications · doi:10.1016/0024-3795(92)90393-o · Cited by 85
GPU-Accelerated Sparse Matrix-Matrix Multiplication by Iterative Row Merging
Gremse, F., Höfter, A., Schwen, L. O., Kiessling, F. M., & Naumann, U. (2015) · SIAM Journal on Scientific Computing · doi:10.1137/130948811 · Cited by 82
On Asymptotic Security Estimates in XL and Gröbner Bases-Related Algebraic Cryptanalysis
Yang, B., Chen, J.-M., & Courtois, N. T. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30191-2_31 · Cited by 80
A group-theoretic approach to fast matrix multiplication
Cohn, H., & Umans, C. (2004) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2003.1238217 · Cited by 105
On the Complexity of Matrix Product
Raz, R. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539702402147 · Cited by 84
Al‐Baali, M., Spedicato, E., & Maggioni, F. (2013) · Optimization methods & software · doi:10.1080/10556788.2013.856909 · Cited by 77
Fast matrix multiplication is stable
Demmel, J. W., Dumitriu, I., Holtz, O., & Kleinberg, R. (2007) · Numerische Mathematik · doi:10.1007/s00211-007-0061-6 · Cited by 81
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings
Björklund, A., & Husfeldt, T. (2007) · Algorithmica · doi:10.1007/s00453-007-9149-8 · Cited by 77
Applying Modular Decomposition to Parameterized Cluster Editing Problems
Protti, F., da Silva, M. D., & SZWARCFITER, J. L. (2007) · Theory of Computing Systems · doi:10.1007/s00224-007-9032-7 · Cited by 76
Factoring in Skew-polynomial Rings over Finite Fields
Giesbrecht, M. W. (1998) · Journal of Symbolic Computation · doi:10.1006/jsco.1998.0224 · Cited by 75
Cohen, E., & Zwick, U. (2001) · Journal of Algorithms · doi:10.1006/jagm.2000.1117 · Cited by 75
A survey on the linear ordering problem for weighted or unweighted tournaments
Charon, I., & Hudry, O. (2007) · 4OR · doi:10.1007/s10288-007-0036-6 · Cited by 75
Three-Coloring and List Three-Coloring of Graphs Without Induced Paths on Seven Vertices
Bonomo, F., Chudnovsky, M., Maceli, P., Schaudt, O., Stein, M., & Zhong, M. (2017) · COMBINATORICA · doi:10.1007/s00493-017-3553-8 · Cited by 75
Fast parallel constraint satisfaction
Kirousis, L. M. (1993) · Artificial Intelligence · doi:10.1016/0004-3702(93)90063-h · Cited by 75
Bogale, T. E., & Vandendorpe, L. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2011.2179538 · Cited by 74
Saki, A. A., Alam, M., & Ghosh, S. (2019) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/3316781.3317888 · Cited by 76
All-Pairs Shortest Paths with Real Weights in O(n 3/log n) Time
Chan, T. M. (2007) · Algorithmica · doi:10.1007/s00453-007-9062-1 · Cited by 80
Witnesses for Boolean matrix multiplication and for shortest paths
Alon, N., Galil, Z., Margalit, O., & Naor, M. (1992) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1992.267748 · Cited by 74
Cross Subspace Alignment Codes for Coded Distributed Batch Computation
Jia, Z., & Jafar, S. A. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3064827 · Cited by 73
FPGA accelerator for floating-point matrix multiplication
Jovanović, Z., & Milutinović, V. M. (2012) · IET Computers & Digital Techniques · doi:10.1049/iet-cdt.2011.0132 · Cited by 74
New Techniques for Private Stream Searching
Bethencourt, J., Song, D. X., & Waters, B. R. (2009) · ACM Transactions on Information and System Security · doi:10.1145/1455526.1455529 · Cited by 73
Open problems around exact algorithms
Woeginger, G. J. (2007) · Discrete Applied Mathematics · doi:10.1016/j.dam.2007.03.023 · Cited by 73
Faster Matrix Multiplication via Asymmetric Hashing
Duan, R., Wu, H., & Zhou, R. (2023) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs57990.2023.00130 · Cited by 135
Real‐time Bayesian anomaly detection in streaming environmental data
Hill, D., Minsker, B. S., & Eyal Amir, A. (2009) · Water Resources Research · doi:10.1029/2008wr006956 · Cited by 72
The border rank of the multiplication of 2×2 matrices is seven
Landsberg, J. M. (2005) · Journal of the American Mathematical Society · doi:10.1090/s0894-0347-05-00506-0 · Cited by 76
Fast matrix rank algorithms and applications
Cheung, H. Y., Kwok, T. C., & Lau, L. C. (2013) · Journal of the ACM · doi:10.1145/2528404 · Cited by 71
Tripartite Entanglement Transformations and Tensor Rank
Chitambar, E., Duan, R., & Shi, Y. (2008) · Physical Review Letters · doi:10.1103/physrevlett.101.140502 · Cited by 73
The Mailman algorithm: A note on matrix–vector multiplication
Liberty, E., & Zucker, S. W. (2008) · Information Processing Letters · doi:10.1016/j.ipl.2008.09.028 · Cited by 71
A fully dynamic algorithm for maintaining the transitive closure
King, V., & Sagert, G. (1999) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/301250.301380 · Cited by 71
A fast parallel Gauss Jordan algorithm for matrix inversion using CUDA
Sharma, G., Agarwala, A., & Bhattacharya, B. (2013) · Computers & Structures · doi:10.1016/j.compstruc.2013.06.015 · Cited by 73
Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter
Abboud, A., Gr, F., & Williams, O. V. V. (2015) · Cited by 69
On the complexity of the multiplication of matrices of small formats
Bläser, M. (2003) · Journal of Complexity · doi:10.1016/s0885-064x(02)00007-9 · Cited by 79
Tight Bounds on the Simultaneous Estimation of Incompatible Parameters
Sidhu, J. S., Ouyang, Y., Campbell, E. T., & Kok, P. (2021) · Physical Review X · doi:10.1103/physrevx.11.011028 · Cited by 72
Algebraic Algorithms for Matching and Matroid Problems
Harvey, N. J. A. (2009) · SIAM Journal on Computing · doi:10.1137/070684008 · Cited by 68
A queueing analysis for the denial of service (DoS) attacks in computer networks
Wang, Y., Lin, C., Li, Q., & Fang, Y. M. (2007) · Computer Networks · doi:10.1016/j.comnet.2007.02.011 · Cited by 68
Locally linear reconstruction for instance-based learning
Kang, P., & Cho, S. (2008) · Pattern Recognition · doi:10.1016/j.patcog.2008.04.009 · Cited by 68
Improved Dynamic Reachability Algorithms for Directed Graphs
Roditty, L., & Zwick, U. (2008) · SIAM Journal on Computing · doi:10.1137/060650271 · Cited by 68
Dense Linear Algebra over Word-Size Prime Fields
Dumas, J., Pascal Giorgi, A., & Pernet, C. (2008) · ACM Transactions on Mathematical Software · doi:10.1145/1391989.1391992 · Cited by 79
Efficient algorithms for clique problems
Williams, V. V. (2008) · Information Processing Letters · doi:10.1016/j.ipl.2008.10.014 · Cited by 78
Mao, M., Li, J., Jin, L., Li, S., & Zhang, Y. (2016) · Neurocomputing · doi:10.1016/j.neucom.2016.05.010 · Cited by 66
Fast approximation of centrality
Eppstein, D., & Wang, J. (2001) · Symposium on Discrete Algorithms · doi:10.5555/365411.365449 · Cited by 66
Using structure indices for efficient approximation of network properties
Rattigan, M. J., Maier, M. E., & Jensen, D. D. (2006) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1150402.1150443 · Cited by 66
Approximate Fast Graph Fourier Transforms via Multilayer Sparse Approximations
Magoarou, L. L., Gribonval, R., & Tremblay, N. (2017) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2017.2710619 · Cited by 67
Convex drawings of graphs in two and three dimensions (preliminary version)
Chrobák, M., Goodrich, M. T., & Tamassia, R. (1996) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/237218.237401 · Cited by 66
Combinatorial and computational aspects of graph packing and graph decomposition
Yuster, R. (2007) · Computer Science Review · doi:10.1016/j.cosrev.2007.07.002 · Cited by 65
Wei, P., Chen, L., & Sun, D. (2013) · Transportation Research Part E Logistics and Transportation Review · doi:10.1016/j.tre.2013.10.008 · Cited by 65
Algorithm sa nd Extre mal Problem on Wiener Polarity Index
Du, W., Li, X., & Shi, Y. (2009) · Cited by 65
Faster algorithms for finding lowest common ancestors in directed acyclic graphs
Czumaj, A., Kowaluk, M., & Andrzej Lingas, B. (2007) · Theoretical Computer Science · doi:10.1016/j.tcs.2007.02.053 · Cited by 65
The aggregation and cancellation techniques as a practical tool for faster matrix multiplication
Kaporin, I. (2004) · Theoretical Computer Science · doi:10.1016/j.tcs.2004.01.004 · Cited by 66
All Pairs Shortest Distances for Graphs with Small Integer Length Edges
Galil, Z., & Margalit, O. (1997) · Information and Computation · doi:10.1006/inco.1997.2620 · Cited by 64
An updated survey on the linear ordering problem for weighted or unweighted tournaments
Charon, I., & Hudry, O. (2009) · Annals of Operations Research · doi:10.1007/s10479-009-0648-7 · Cited by 64
The h-Index of a Graph and its Application to Dynamic Subgraph Statistics
Eppstein, D., & Spiro, E. S. (2012) · Journal of Graph Algorithms and Applications · doi:10.7155/jgaa.00273 · Cited by 64
Dense community detection in multi-valued attributed networks
Huang, X. S., Cheng, H., & Yu, J. X. (2015) · Information Sciences · doi:10.1016/j.ins.2015.03.075 · Cited by 64
Stabilization of perturbed Boolean network attractors through compensatory interactions
Campbell, C., & Albert, R. (2014) · BMC Systems Biology · doi:10.1186/1752-0509-8-53 · Cited by 64
On the Security of HFE, HFEv- and Quartz
Courtois, N. T., Daum, M., & Felke, P. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36288-6_25 · Cited by 64
Parametrization of Newton's iteration for computations with structured matrices and applications
Pan, V. Y. (1992) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(92)90215-4 · Cited by 64
A Local Graph Partitioning Algorithm Using Heat Kernel Pagerank
Chung, F. (2009) · Internet Mathematics · doi:10.1080/15427951.2009.10390643 · Cited by 63
FrodoPIR: Simple, Scalable, Single-Server Private Information Retrieval
Davidson, A., Pestana, G., & Celi, S. (2023) · Proceedings on Privacy Enhancing Technologies · doi:10.56553/popets-2023-0022 · Cited by 64
PageRank optimization by edge selection
Csáji, B. C., Jungers, R. M., & Blondel, V. D. (2014) · Discrete Applied Mathematics · doi:10.1016/j.dam.2014.01.007 · Cited by 62
Geometry and the complexity of matrix multiplication
Landsberg, J. M. (2008) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-08-01176-2 · Cited by 63
LQG Control and Sensing Co-Design
Tzoumas, V., Carlone, L., Pappas, G. J., & Jadbabaie, A. (2020) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2020.2997661 · Cited by 62
On Sunflowers and Matrix Multiplication
Alon, N., Shpilka, A., & Umans, C. (2012) · Computational Complexity · doi:10.1007/s00037-013-0060-1 · Cited by 68
Detecting short directed cycles using rectangular matrix multiplication and dynamic programming
Yuster, R., & Zwick, U. (2004) · doi:10.5555/982792.982828 · Cited by 62
A framework for practical parallel fast matrix multiplication
Benson, A. R., & Ballard, G. (2015) · ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming · doi:10.1145/2688500.2688513 · Cited by 66
Path Laplacian matrices: Introduction and application to the analysis of consensus in networks
Estrada, E. (2011) · Linear Algebra and its Applications · doi:10.1016/j.laa.2011.11.032 · Cited by 61
Solving tall dense linear programs in nearly linear time
van den Brand, J., Lee, Y. T., Sidford, A., & Song, Z. (2020) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3357713.3384309 · Cited by 75
Computational complexity for physicists
Mertens, S. (2002) · Computing in Science & Engineering · doi:10.1109/5992.998639 · Cited by 63
Self-adapting software for numerical linear algebra and LAPACK for clusters
Chen, Z., Dongarra, J. J., Łuszczek, P., & Roche, K. J. (2003) · Parallel Computing · doi:10.1016/j.parco.2003.05.014 · Cited by 63
Recognition Algorithms for Orders of Small Width and Graphs of Small Dilworth Number
Felsner, S., Raghavan, V., & Spinrad, J. (2003) · Order · doi:10.1023/b:orde.0000034609.99940.fb · Cited by 64
Metadata
- Authors
- Coppersmith, D., & Winograd, S.
- Affiliations
- IBM Research - Thomas J. Watson Research Center (US)
- Venue
- Journal of Symbolic Computation
- Publisher
- Elsevier BV
- Published
- 1990-03
- Volume
- 9
- Issue
- 3
- Pages
- 251-280
- ISSN
- 0747-7171 (ISSN-L)
- OpenAlex
- W1979740015
- Cited by
- 2,248
- References
- 8
- Citations by year
- 2026: 18 · 2025: 29 · 2024: 35 · 2023: 39 · 2022: 42 · 2021: 65 · 2020: 77 · 2019: 92 · 2018: 95 · 2017: 72 · 2016: 64 · 2015: 75 · 2014: 94 · 2013: 112 · 2012: 120
- FWCI
- 34.22
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- Locations
- Journal of Symbolic Computation (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Matrix Theory and Algorithms
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Polynomial and algebraic computation
- Keywords
- matrix multiplication, asymptotic complexity, arithmetic progressions, trilinear forms, Strassen's algorithm, matrix exponent
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
