Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time (2003)

by Daniel A. Spielman , Shang-hua Teng
Citations:145 - 13 self