A mostrar 1 - 1 resultados de 1 para a pesquisa 'Spielman, Daniel A.', tempo de pesquisa: 0.01seg Refinar resultados
  1. 1

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

    Publicado no Journal of the ACM
    Artigo

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

Ferramentas de pesquisa: