Pages that link to "Item:Q5056400"
From MaRDI portal
The following pages link to Solving Linear Programs in the Current Matrix Multiplication Time (Q5056400):
Displaying 13 items.
- Solving related two- and three-dimensional linear programming problems in logarithmic time (Q1091934) (← links)
- Using fast matrix multiplication to find basic solutions (Q1275090) (← links)
- Nearly linear-time packing and covering LP solvers. Nearly linear-time packing and covering LP solvers, achieving width-independence and \(=(1/\varepsilon)\)-convergence (Q2414908) (← links)
- Solving tall dense linear programs in nearly linear time (Q5144963) (← links)
- A Deterministic Linear Program Solver in Current Matrix Multiplication Time (Q5146781) (← links)
- (Q5158495) (← links)
- Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem (Q6080763) (← links)
- Linear Programs with Conjunctive Database Queries (Q6151558) (← links)
- Economic lot sizing problem with tank scheduling (Q6167403) (← links)
- Representation recovery via \(L_1\)-norm minimization with corrupted data (Q6199567) (← links)
- Weighted packet selection for rechargeable links in cryptocurrency networks: complexity and approximation (Q6201318) (← links)
- Efficient use of quantum linear system algorithms in inexact infeasible IPMs for linear optimization (Q6596332) (← links)
- The hexatope and octatope abstract domains for neural network verification (Q6661753) (← links)