A Deterministic {\operatorname{Poly}}(\log \log N)-TimeN-Processor Algorithm for Linear Programming in Fixed Dimension
From MaRDI portal
Publication:5691289
Recommendations
- scientific article; zbMATH DE number 437553
- On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
- An O(n log n)-algorithm for solving a special class of linear programs
- A Deterministic Linear Program Solver in Current Matrix Multiplication Time
- A new polynomial-time algorithm for linear programming
- scientific article; zbMATH DE number 4121753
- Parallel linear programming in fixed dimension almost surely in constant time
- Improved deterministic algorithms for linear programming in low dimensions
- Improved deterministic algorithms for linear programming in low dimensions
- An entire space polynomial-time algorithm for linear programming
Cited in
(10)- Fast and optimal parallel multidimensional search in PRAMs with applications to linear programming and related problems
- Lower bounds for parallel linear programming and other problems
- Linear Programming with Two Variables Per Inequality in Poly-Log Time
- Linear Programming in Linear Time When the Dimension Is Fixed
- On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
- Parallel linear programming in fixed dimension almost surely in constant time
- scientific article; zbMATH DE number 1182931 (Why is no real title available?)
- Two-variable linear programming in parallel
- A Deterministic Linear Program Solver in Current Matrix Multiplication Time
- Two-variable linear programming in parallel
This page was built for publication: A Deterministic ${\operatorname{Poly}}(\log \log N)$-TimeN-Processor Algorithm for Linear Programming in Fixed Dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5691289)
