Pages that link to "Item:Q1343466"

The following pages link to Polynomial algorithms for linear programming over the algebraic numbers (Q1343466):

Displaying 15 items.

• Tractability conditions for numeric CSPs (Q683751) (← links)
• Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices (Q687079) (← links)
• Some lower bounds for the complexity of the linear programming feasibility problem over the reals (Q998976) (← links)
• A fully polynomial time projective method (Q1104857) (← links)
• On linear programming and matrix scaling over the algebraic numbers (Q1361844) (← links)
• The equivalence of linear programs and zero-sum games (Q1939509) (← links)
• Polynomial algorithms for \(m\times (m+1)\) integer programs and \(m\times (m+k)\) diophantine systems (Q2265948) (← links)
• On the realisability of double-cross matrices by polylines in the plane (Q2396825) (← links)
• (Q3050157) (← links)
• (Q3204331) (← links)
• (Q3977200) (← links)
• Large final polynomials from integer programming (Q5101999) (← links)
• On a transfer theorem for the \(\text{P}\neq \text{NP}\) conjecture (Q5938580) (← links)
• Exact algorithms for linear programming over algebraic extensions (Q5953595) (← links)
• Entropic risk for turn-based stochastic games (Q6647757) (← links)