Subexponential lower bounds for randomized pivoting rules for the simplex algorithm

Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick. Subexponential lower bounds for randomized pivoting rules for the simplex algorithm. In Lance Fortnow, Salil P. Vadhan, editors, Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011. pages 283-292, ACM, 2011. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.