Open problems in computational linear algebra

DOI10.1016/j.na.2004.12.040zbMath1153.90588OpenAlexW1967066916MaRDI QIDQ999481

J. Martínez

Publication date: 4 February 2009

Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.na.2004.12.040

zbMATH Keywords

optimizationcomplexityopen problemscomputational linear algebrapolynomial-time deterministic algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05)

Related Items (1)

The bilinear complexity and practical algorithms for matrix multiplication

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Complexity of linear programming
• Direct fail-proof triangularization algorithms for \(AX+XB=C\) with error- free and parallel implementations
• Stabilizing Trench's algorithm to invert symmetric Toeplitz matrices
• Solving linear programming problems exactly
• \(O(n^ 3)\) noniterative heuristic algorithm for linear programs with error-free implementation.
• PRIMES is in P
• On the computational power of pushdown automata

This page was built for publication: Open problems in computational linear algebra