Semi-algebraic complexity -- Additive complexity of matrix computational tasks
From MaRDI portal
(Redirected from Publication:1361878)
Recommendations
Cites work
- scientific article; zbMATH DE number 4029737 (Why is no real title available?)
- scientific article; zbMATH DE number 4096783 (Why is no real title available?)
- scientific article; zbMATH DE number 3783168 (Why is no real title available?)
- scientific article; zbMATH DE number 1080058 (Why is no real title available?)
- scientific article; zbMATH DE number 195158 (Why is no real title available?)
- How to multiply matrices faster
- La topologie du spectre réel
- Lectures on the complexity of bilinear problems
- Matrix multiplication via arithmetic progressions
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- On the Asymptotic Complexity of Matrix Multiplication
- On the number of multiplications necessary to compute certain functions
- On the real spectrum of a ring and its application to semialgebraic geometry
- Semi-algebraic complexity of quotients and sign determination of remainders
- Semi-algebraic decision complexity, the real spectrum, and degree
- Some computational problems in linear algebra as hard as matrix multiplication
- Taylor expansion of the accumulated rounding error
- The complexity of partial derivatives
Cited in
(5)- Some computational problems in linear algebra as hard as matrix multiplication
- scientific article; zbMATH DE number 6004867 (Why is no real title available?)
- scientific article; zbMATH DE number 1080058 (Why is no real title available?)
- On the fraction of matrices with maximal additive complexity
- Linear complexity algorithm for semiseparable matrices
This page was built for publication: Semi-algebraic complexity -- Additive complexity of matrix computational tasks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361878)
