Improved bound for complexity of matrix multiplication

Gaussian elimination is not optimal

Strassen, V. (1969) · Numerische Mathematik · doi:10.1007/bf02165411 · Cited by 2,509

Matrix multiplication via arithmetic progressions

Coppersmith, D., & Winograd, S. (1990) · Journal of Symbolic Computation · doi:10.1016/s0747-7171(08)80013-2 · Cited by 2,248

Algebraic Complexity Theory

Bürgisser, P., Clausen, M. V., & Shokrollahi, M. A. (1997) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-3-662-03338-8 · Cited by 1,103

Gaussian Elimination is not Optimal

Trassen, V. (2005) · Cited by 454

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

O(n2.7799) complexity for n × n approximate matrix multiplication

Bini, D. A., Capovani, M., Romani, F., & Lotti, G. (1979) · Information Processing Letters · doi:10.1016/0020-0190(79)90113-3 · Cited by 232

On the Asymptotic Complexity of Matrix Multiplication

Coppersmith, D., & Winograd, S. (1982) · SIAM Journal on Computing · doi:10.1137/0211038 · Cited by 221

Relative bilinear complexity and matrix multiplication.

Strassen, V. (1987) · Journal für die reine und angewandte Mathematik (Crelles Journal) · doi:10.1515/crll.1987.375-376.406 · Cited by 170

On the complexity of matrix multiplication

Stothers, A. J. (2010) · ERA · Cited by 167

Electromagnetic field in superconductor samples using a partitioned E-H finite element scheme

Fernandes, J. F. P., & Machado, V. M. (2018) · Journal of Magnetism and Magnetic Materials · doi:10.1016/j.jmmm.2018.11.068 · Cited by 3

Linear Time Algorithm to Check the Singularity of Block Graphs

Singh, R., Shaked-Monderer, N., & Berman, A. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-11509-8_7 · Cited by 3

Irreversibility of structure tensors of modules

Wojtala, M. (2022) · Collectanea mathematica · doi:10.1007/s13348-022-00361-w · Cited by 3

Fast Approximate Matrix Multiplication by Solving Linear SystemsPreprint

Manne, S., & Pal, M. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1408.4230 · Cited by 3

A technology demonstration of propagator matrix power method for calculation of electron velocity distribution functions in gas in long-term transient and succeeding equilibrium states under dc electric fields

Sugawara, H., & Iwamoto, H. (2021) · Japanese Journal of Applied Physics · doi:10.35848/1347-4065/abe8a7 · Cited by 2

On Matrix Multiplication and Polynomial Identity Testing

Andrews, R. (2024) · SIAM Journal on Computing · doi:10.1137/22m1536169 · Cited by 2

Rate optimization for massive MIMO relay networks: A minorization-maximization approach

Naghsh, M. M., Soltanalian, M., Stoica, P., Masjedi, M., & Ottersten, B. (2016) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2016.7472350 · Cited by 2

Single-particle model of a strongly driven, dense, nanoscale quantum ensemble

DiLoreto, C., & Rangan, C. (2018) · Physical Review A · doi:10.1103/physreva.97.013812 · Cited by 2

Low-complexity differential modulation for high mobility MIMO-OFDM

Setiawan, D. P., & Zhao, H.-A. (2018) · IEICE Communications Express · doi:10.1587/comex.2018xbl0115 · Cited by 2

Performance Analysis of Separating Function Estimation Test for Impropriety of Complex Signals

Lai, H., Xu, W., Dai, J., Zhou, Y., & Yang, Q. (2022) · IEEE Signal Processing Letters · doi:10.1109/lsp.2022.3207623 · Cited by 2

Simpler, Linear-Time Transitive Orientation via Lexicographic Breadth-First SearchPreprint

Tedder, M. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1503.02773 · Cited by 2

On Matrix Multiplication and Polynomial Identity Testing

Andrews, R. (2022) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs54457.2022.00041 · Cited by 1

An extended view on lifting Gaussian Bayesian networks

Hartwig, M., Möller, R., & Braun, T. (2024) · Artificial Intelligence · doi:10.1016/j.artint.2024.104082 · Cited by 1

Neural-Network-Augmented Tobit Kalman Filter With Adaptive Covariance for Censored State Estimation

Jetawatthana, S., & Khamvilai, T. (2026) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2026.3695448 · Cited by 1

Быстрое умножение матриц и смежные вопросы алгебры

Pan, V. Y. (2017) · Математический сборник · doi:10.4213/sm8833 · Cited by 1

On Distributed Estimation for Resource Constrained Wireless Sensor Networks

Sani, A. (2017) · Journal of International Crisis and Risk Communication Research · Cited by 1

Boosted Test-FDA: a transductive boosting method

Mashhadi, P. S. (2018) · Pattern Analysis and Applications · doi:10.1007/s10044-018-0710-7 · Cited by 1

Factor base discrete logarithms in Kummer extensions

Xiao, D., Zhuang, J., & Cheng, Q. (2018) · Finite Fields and Their Applications · doi:10.1016/j.ffa.2018.06.008 · Cited by 1

Simplified User Grouping Algorithm for Massive MIMO on Sparse Beam-Space Channels

Soleimani, M., Mazrouei‐Sebdani, M., Elliott, R. C., Krzymień, W. A., & Melzer, J. (2018) · IEICE Transactions on Communications · doi:10.1587/transcom.2018ebp3081 · Cited by 1

Matrix Multiplication: Verifying Strong Uniquely Solvable Puzzles

Anderson, M., Ji, Z., & Xu, A. Y. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-51825-7_32 · Cited by 1

Mappings for Transformation of Near-Regular Domains to Regular Domains

Kaveh, A., Rahami, H., & Shojaei, I. (2020) · Studies in systems, decision and control · doi:10.1007/978-3-030-45549-1_9 · Cited by 1

Parameterized complexity of determinant and permanent

Singh, R. (2020) · Theoretical Computer Science · doi:10.1016/j.tcs.2020.08.031 · Cited by 1

A Heuristic Algorithm for Finding Attractive Fixed-Length Circuits in Street Maps

Lewis, R. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-59747-4_25 · Cited by 1

Sketching with Kerdock's Crayons: Fast Sparsifying Transforms for Arbitrary Linear Maps

Fuchs, T., Gross, D., Krahmer, F., Kueng, R., & Mixon, D. G. (2022) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/21m1438992 · Cited by 1

Multi-response deconvolution of auditory evoked potentials in a reduced representation space

de la Torre, Á., Sanchez, I., Alvarez, I. M., Segura, J. C., Valderrama, J. T., Muller, N., & Vargas, J. L. (2024) · The Journal of the Acoustical Society of America · doi:10.1121/10.0026228 · Cited by 1

Summary of Fast Matrix Multiplication Algorithms

Respondek, J. S. (2025) · Studies in big data · doi:10.1007/978-3-031-76930-6_8 · Cited by 1

The social and biological effects of patient-patient co-presence on health in hospitals using electronic medical records

Lienert, J. (2018) · Oxford University Research Archive (ORA) (University of Oxford) · doi:10.5287/ora-o1y6pxj19 · Cited by 1

A Model Selection Approach to Hierarchical Shape Clustering with an Application to Cell ShapesPreprint

Mirshahi, M., Nia, V. P., & Asgharian, M. (2020) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2020.04.29.067892 · Cited by 1

Finite Matrix Multiplication Algorithms from Infinite GroupsPreprint

Blasiak, J., Cohn, H., Grochow, J. A., Pratt, K., & Umans, C. (2024) · arXiv (Cornell University) · doi:10.4230/lipics.itcs.2025.18 · Cited by 1

Quantum Control of Open Systems and Dense Atomic Ensembles

DiLoreto, C. (2017)

Plataforma de estudo para determinação de conectividade cerebral embarcada e em tempo real.

da Silva, T. S. (2016) · Digital Library of Theses and Dissertations (Universidade de São Paulo) · doi:10.11606/d.3.2016.tde-30062016-075729

$\ell_1$ Regression using Lewis Weights Preconditioning and Stochastic Gradient DescentPreprint

Durfee, D., Lai, K. A., & Sawlani, S. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1708.07821

Advanced Methods for Efficient Digital Signal Processing and Matrix-Based Computations

Coelho, G. G. B. (2018) · Libraries and Cultural Resources (University of Calgary) · doi:10.11575/prism/31793

Algorithm for B-partitions, parameterized complexity of the matrix determinant and permanent.Preprint

Singh, R., Vijay, V., & Bapat, R. B. (2018) · arXiv (Cornell University)

Matrix-Based Algorithms for DataFlow Computer Architecture: An Overview and Comparison

Mihelič, J., & Čibej, U. (2019) · Computer communications and networks · doi:10.1007/978-3-030-13803-5_4

Efektivní násobení řídkých matic

Quang, T. (2019) · Czech Technical University Digital Library (Czech Technical University in Prague)

Aligning Statistical Dynamics Captures Biological Network FunctioningPreprint

Langendorf, R. E., & Goldberg, D. S. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1912.12551

Solving optimal control problems with integral equations or integral equations - differential with the help of cubic B-spline scaling functions and wavelets

Mesgarani, H., Safdari, H., & Ghasemian, A. (2020) · Mathematical Researches · doi:10.52547/mmr.6.1.119

Trust-based Multiagent Consensus or Weightings AggregationPreprint

Yun, B., & Madalina Croitoru, A. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2004.02490

On Distributed Estimation for Power Constrained Wireless Sensor Networks

Shirazi, M. (2019) · Journal of International Crisis and Risk Communication Research

Lower Bounds on Rate of Convergence of Matrix Products in All Pairs Shortest Path of Social NetworkPreprint

Shen, D. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2006.13412

A linear time algorithm for the nullity of vertex-weighted block graphs

Singh, R., Shaked-Monderer, N., & Berman, A. (2021) · Discrete Applied Mathematics · doi:10.1016/j.dam.2020.12.028

Regularized OFU: an Efficient UCB Estimator forNon-linear Contextual BanditPreprint

Zhou, Y., Song, S., Zhang, H., Zhu, J., Chen, W., & Liu, T. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.15128

Statistical Inference for High-dimensional Nonparametric Models

Li, J. (2021) · Kent Academic Repository (University of Kent) · doi:10.22024/unikent/01.02.89925

Dual Fermion Approach to Disordered Correlated Systems

Haase, P. (2015) · eDiss (Georg-August-Universität Göttingen) · doi:10.53846/goediss-5354

An efficient counting method for the colored triad censusPreprint

Lienert, J., Koehly, L. M., Reed‐Tsochas, F., & Marcum, C. S. (2017) · SocArXiv (OSF Preprints) · doi:10.31235/osf.io/rd6kw

Combinatorial and recurrent approaches for efficient matrix inversion: Sub-cubic algorithms leveraging fast matrix products

Riahi, M. K. (2026) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2026.117351

Adaptive matrix multiplication for various degree of sparsity using tensorflow

Theeracheep, S., & Chongstitvatana, J. (2019) · Chula Digiverse · doi:10.58837/chula.the.2019.166

Bounded Simultaneous MessagesPreprint

Bogdanov, A., Dinesh, K., Filmus, Y., Ishai, Y., Kaplan, A., & Sekar, S. (2023) · arXiv (Cornell University) · doi:10.4230/lipics.fsttcs.2023.23

A Perusal of Algrebraic and Computational Modelling on Matrix Multiplication Time Complexity

Choudhury, M. R., & Banerjee, I. (2023) · International Conference on Advanced Computer Information Technologies (ACIT) · doi:10.1109/acit58437.2023.10275419

Efficiently-Verifiable Strong Uniquely Solvable Puzzles and Matrix Multiplication

Anderson, M., & Le, V. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-49193-1_4

Revisiting “Rapid multiplication of rectangular matrices”

Nissim, R., & Schwartz, O. (2024) · Research in Mathematics · doi:10.1080/27684830.2024.2388334

Matrix-by-matrix multiplication algorithm with $O(N^2log_2N)$ computational complexity for variable precision arithmeticPreprint

Paszyński, M. R. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2410.21050

MIMO-OFDM System Performance and Parameter Estimations in Presence of Design Imperfections

Matin, S. A., & Milstein, L. B. (2025) · IEEE Access · doi:10.1109/access.2025.3610817

Efficient approximations of matrix multiplication using truncated decompositionsPreprint

Kar, S., M., H., А.Н., С., & Venkatapathi, M. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2504.19308

The Bayesian Global Sky Model (B-GSM)

Carter, G. (2024) · Apollo (University of Cambridge) · doi:10.17863/cam.118909

Slice rank and fast matrix multiplication

van de Berg, N. (2025) · TU/e Research Portal

Computational homology applied to discrete objects

Gonzalez-Lorenzo, A. (2016) · theses.fr (ABES) · doi:10.70675/a95fcb81ze808z4eafz9f6dz26764b15c6b2

Brief Announcement: An Automatic Framework for High Performance Alternative Basis Fast Matrix Multiplication

Bruker, N., Schwartz, O., & Vaknin, N. (2026) · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · doi:10.1145/3816782.3819195

Algorithms and Complexity

Grechuk, B. (2026) · Springer eBooks · doi:10.1007/978-3-032-26888-4_7

Timeline of 21st Century Mathematics

Grechuk, B. (2026) · Springer eBooks · doi:10.1007/978-3-032-26888-4_10

Asymptotic Rank of Weighted Graph Tensors via Completely Positive CoversPreprint

Zhou, H. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2610.34273

Semidirect sums of tensors and the matrix multiplication exponentPreprint

Li, B. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2611.04175

An overview of the recent progress on matrix multiplication

Williams, V. V. (2012)

On the complexity of matrix multiplication

Stothers, A. J. (2010) · ERA · Cited by 167

Breaking the Coppersmith-Winograd barrier

Williams, V. V. (2011)

Multiplying matrices faster than coppersmith-winograd

Williams, V. V. (2012) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2213977.2214056 · Cited by 908

Algorithms column

Khuller, S. (2012) · ACM SIGACT News · doi:10.1145/2421119.2421134 · Cited by 5