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.

檢索工具: