Mostrar 1 - 1 resultats de 1 per cerca 'Spielman, Daniel A.', hora de la petició: 0.01sec Refinar resultats
  1. 1

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

    Publicat a Journal of the ACM
    Article

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

Eines de cerca: