Amanote Research

Amanote Research

    RegisterSign In

Geometry and the Complexity of Matrix Multiplication

Bulletin of the American Mathematical Society - United States
doi 10.1090/s0273-0979-08-01176-2
Full Text
Open PDF
Abstract

Available in full text

Categories
MathematicsApplied Mathematics
Date

January 7, 2008

Authors
J. M. Landsberg
Publisher

American Mathematical Society (AMS)


Related search

The Complexity of Simulation and Matrix Multiplication

2017English

On Sunflowers and Matrix Multiplication

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2013English

Enhanced Matrix Chain Multiplication

Journal of Cyber Security and Mobility
HardwareComputer NetworksArchitectureCommunications
2018English

Fast Sparse Matrix Multiplication

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Strassen's Matrix Multiplication on GPUs

2011English

Register-Based Implementation of the Sparse General Matrix-Matrix Multiplication on GPUs

2018English

Sparse Matrix-Vector Multiplication on GPGPUs

ACM Transactions on Mathematical Software
Applied MathematicsSoftware
2017English

Multiplicative Complexity of Polynomial Multiplication Over Finite Fields

1987English

Extracellular Matrix: Understanding the Complexity

Brazilian Journal of Medical and Biological Research
ImmunologyCell BiologyPharmacologyBiochemistryBiophysicsNeuroscienceMedicineToxicologyPhysiologyPharmaceutics
1999English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy