Pages that link to "Item:Q2490340"
From MaRDI portal
The following pages link to Improved complexity results on solving real-number linear feasibility problems (Q2490340):
Displaying 9 items.
- A condition-based algorithm for solving polyhedral feasibility problems (Q457560) (← links)
- Relaxation, new combinatorial and polynomial algorithms for the linear feasibility problem (Q705124) (← links)
- Some lower bounds for the complexity of the linear programming feasibility problem over the reals (Q998976) (← links)
- Improved complexity bounds for location problems on the real line (Q1180820) (← links)
- Condition numbers for polyhedra with real number data (Q1924613) (← links)
- Computational complexity of real powering and improved solving linear differential equations (Q2330561) (← links)
- How partial knowledge helps to solve linear programs (Q2365419) (← links)
- Faster real feasibility via circuit discriminants (Q2883798) (← links)
- A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix (Q6120839) (← links)
