Spielman, D. A. Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. Journal of the ACM.
Lua i Stíl Chicago (17ú heag.)Spielman, Daniel A. "Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time." Journal of the ACM .
Lua MLA (9ú heag.)Spielman, Daniel A. "Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time." Journal of the ACM, .
Rabhadh: Seans nach mbeach na luanna seo go hiomlán cruinn i ngach uile chás.