Semi-algebraic complexity -- Additive complexity of matrix computational tasks
From MaRDI portal
Publication:1361878
DOI10.1006/JCOM.1997.0430zbMATH Open0887.68038OpenAlexW2071763554MaRDI QIDQ1361878FDOQ1361878
Authors: Thomas Lickteig, Klaus Meer 
Publication date: 26 August 1997
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcom.1997.0430
Recommendations
Cites Work
- Title not available (Why is that?)
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- The complexity of partial derivatives
- La topologie du spectre réel
- Some computational problems in linear algebra as hard as matrix multiplication
- How to multiply matrices faster
- Matrix multiplication via arithmetic progressions
- On the Asymptotic Complexity of Matrix Multiplication
- Title not available (Why is that?)
- On the number of multiplications necessary to compute certain functions
- Taylor expansion of the accumulated rounding error
- Lectures on the complexity of bilinear problems
- On the real spectrum of a ring and its application to semialgebraic geometry
- Title not available (Why is that?)
- Semi-algebraic complexity of quotients and sign determination of remainders
- Title not available (Why is that?)
- Semi-algebraic decision complexity, the real spectrum, and degree
- Title not available (Why is that?)
Cited In (5)
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)
