Mostrando 1 - 1 resultados de 1 para a busca 'Spielman, Daniel A.', tempo de busca: 0.01s 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 busca: