Showing 1 - 1 results of 1 for search 'Spielman, Daniel A.', זמן שאילתה: 0.01s Refine Results
  1. 1

    Smoothed analysis of algorithms Why the simplex algorithm usually takes polynomial time. מאת Spielman, Daniel A.

    הוצא לאור ב Journal of the ACM
    Article

    Smoothed analysis of algorithms Why the simplex algorithm usually takes polynomial time.

כלי חיפוש: