The computational complexity of some problems of linear algebra (extended abstract)
From MaRDI portal
Publication:5048945
DOI10.1007/BFB0023480zbMATH Open1498.68123OpenAlexW1566744832MaRDI QIDQ5048945FDOQ5048945
Authors: Jonathan F. Buss, Gudmund S. Frandsen, Jeffrey Shallit 
Publication date: 9 November 2022
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0023480
Recommendations
Analysis of algorithms and problem complexity (68Q25) Vector spaces, linear dependence, rank, lineability (15A03)
Cites Work
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on matrix rigidity
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
- Title not available (Why is that?)
Cited In (8)
- The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented \(\lambda\) algorithms
- Interval Linear Algebra and Computational Complexity
- The complexity of matrix rank and feasible systems of linear equations
- Computational Complexity and Numerical Stability of Linear Problems
- Title not available (Why is that?)
- Communication complexity of matrix computation over finite fields
- The complexity of linear problems in fields
- Combinatorial optimization methods to determine the rank of a matrix over a commutative ring, with engineering applications
This page was built for publication: The computational complexity of some problems of linear algebra (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5048945)
