Exact algorithms for linear programming over algebraic extensions

DOI10.1007/S00453-001-0049-ZMaRDI QIDQ5953595zbMATH OpenOpenAlexFDO

Authors Peter A. Beling

Publication date 2001

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-001-0049-z

Mathematics Subject Classification ID

Linear programming (90C05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Polynomial algorithms for linear programming over the algebraic numbers
• On linear programming and matrix scaling over the algebraic numbers
• Some lower bounds for the complexity of the linear programming feasibility problem over the reals
• Exact arithmetic at low cost. -- A case study in linear programming
• Complexity investigations on the ellipsoid algorithm

Cited in

(5)

• Deciding probabilistic automata weak bisimulation: theory and practice
• Entropic risk for turn-based stochastic games
• Solving linear programs with finite precision. II: Algorithms
• Exponential behaviour of the Butkovič-Zimmermann algorithm for solving two-sided linear systems in max-algebra
• Polynomial algorithms for linear programming over the algebraic numbers

This page was built for publication: Exact algorithms for linear programming over algebraic extensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5953595)