Pages that link to "Item:Q5212834"
From MaRDI portal
The following pages link to Solving linear programs in the current matrix multiplication time (Q5212834):
Displaying 15 items.
- Solving related two- and three-dimensional linear programming problems in logarithmic time (Q1091934) (← links)
- Solving \((k-1)\)-stable instances of \texttt{k-terminal cut} with isolating cuts (Q2125213) (← links)
- Diameter, Eccentricities and Distance Oracle Computations on <i>H</i>-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension (Q5048290) (← links)
- Solving Linear Programs in the Current Matrix Multiplication Time (Q5056400) (← links)
- Linear equations for unordered data vectors in $[D]^k\to{}Z^d$ (Q5060183) (← links)
- Unit Capacity Maxflow in Almost $m^{4/3}$ Time (Q5071088) (← links)
- (Q5089186) (← links)
- Limits on the Universal method for matrix multiplication (Q5091763) (← links)
- Solving tall dense linear programs in nearly linear time (Q5144963) (← links)
- A Deterministic Linear Program Solver in Current Matrix Multiplication Time (Q5146781) (← links)
- Tensors in computations (Q5887832) (← links)
- Greedy rectilinear drawings (Q5919678) (← links)
- A faster interior-point method for sum-of-squares optimization (Q6053475) (← links)
- Bayesian persuasion: reduced form approach (Q6114948) (← links)
- A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix (Q6120839) (← links)
