Pages that link to "Item:Q5146781"
From MaRDI portal
The following pages link to A Deterministic Linear Program Solver in Current Matrix Multiplication Time (Q5146781):
Displaying 9 items.
- Small one-dimensional Euclidean preference profiles (Q2058844) (← links)
- Solving Linear Programs in the Current Matrix Multiplication Time (Q5056400) (← links)
- Solving tall dense linear programs in nearly linear time (Q5144963) (← links)
- A Deterministic ${\operatorname{Poly}}(\log \log N)$-Time<i>N</i>-Processor Algorithm for Linear Programming in Fixed Dimension (Q5691289) (← links)
- A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix (Q6120839) (← links)
- A simple approach for quantizing neural networks (Q6172170) (← links)
- Efficient use of quantum linear system algorithms in inexact infeasible IPMs for linear optimization (Q6596332) (← links)
- Assigning stationary distributions to sparse stochastic matrices (Q6641768) (← links)
- Accuracy certificates for convex minimization with inexact oracle (Q6661688) (← links)
