77 citations · 188 across the 5 of their papers we have counts for
1 paper · 1 filter
László A. Végh, Giacomo Zambelli
We propose a simple O([n^5/\log n]L) algorithm for linear programming feasibility, that can be considered as a polynomial-time implementation of the relaxation method. Our work dra…