Mostrando 7,861 - 7,870 Resultados de 8,437 Para Buscar '"Problems."', tiempo de consulta: 0.04s Limitar resultados
  1. 7861

    Polynomial algorithms for the maximum stable set problem on particular classes of P5-free graphs. por Mosca, Raffaele

    Artículo

    Polynomial algorithms for the maximum stable set problem on particular classes of P5-free graphs.
  2. 7862

    Intersection number of two connected geometric graphs. por Tokunaga, Shin-ichi

    Artículo

    Intersection number of two connected geometric graphs.
  3. 7863

    Finding pattern matchings for permutations. por Ibarra, Louis

    Artículo

    Finding pattern matchings for permutations.
  4. 7864

    An in-place sorting with O(nlog n) comparisons and O(n) moves. por Franceschini, Gianni

    Publicado en Journal of the ACM
    Artículo

    An in-place sorting with O(nlog n) comparisons and O(n) moves.
  5. 7865

    Asymmetric k-center is log* n-hard to approximate. por Chuzhoy, Julia

    Publicado en Journal of the ACM
    Artículo

    Asymmetric k-center is log* n-hard to approximate.
  6. 7866

    Boosting textual compression in optimal linear time. por Ferragina, Paolo

    Publicado en Journal of the ACM
    Artículo

    Boosting textual compression in optimal linear time.
  7. 7867

    Edge-disjoint routing in plane switch graphs in linear time. por Hochstein, J.M

    Publicado en Journal of the ACM
    Artículo

    Edge-disjoint routing in plane switch graphs in linear time.
  8. 7868

    A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. por Jerrum, Mark

    Publicado en Journal of the ACM
    Artículo

    A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
  9. 7869

    Complexity estimates depending on condition and round-off error. por Cucker, Felipe

    Publicado en Journal of the ACM
    Artículo

    Complexity estimates depending on condition and round-off error.
  10. 7870

    Probabilistic checking of proofs a new characterization of NP. por Arora, Sanjeev

    Publicado en Journal of the ACM
    Artículo

    Probabilistic checking of proofs a new characterization of NP.

Herramientas de búsqueda: