Mostrar 1,001 - 1,010 resultats de 1,181 per cerca '"Complexes."', hora de la petició: 0.02sec Refinar resultats
  1. 1001

    Monotonic reductions, representative equivalence and compilation of intractable problems. per Liberatore, P.

    Publicat a Journal of the ACM
    Article

    Monotonic reductions, representative equivalence and compilation of intractable problems.
  2. 1002

    A Laplace transform algorithm for the volume of a convex polytope. per Lasserre, Jean B.

    Publicat a Journal of the ACM
    Article

    A Laplace transform algorithm for the volume of a convex polytope.
  3. 1003

    An efficient algorithm for image segmentation, Markov random fields and related problems. per Hochbaum, Dorit S.

    Publicat a Journal of the ACM
    Article

    An efficient algorithm for image segmentation, Markov random fields and related problems.
  4. 1004

    Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. per Holm, Jacob

    Publicat a Journal of the ACM
    Article

    Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity.
  5. 1005

    A combinatorial strongly polynomial algorithm for minimizing submodular functions. per Iwata, Satoru

    Publicat a Journal of the ACM
    Article

    A combinatorial strongly polynomial algorithm for minimizing submodular functions.
  6. 1006

    Quantum lower bounds by polynomials. per Beals, Robert

    Publicat a Journal of the ACM
    Article

    Quantum lower bounds by polynomials.
  7. 1007

    Some optimal inapproximability results. per Håstad, Johan

    Publicat a Journal of the ACM
    Article

    Some optimal inapproximability results.
  8. 1008

    Fully dynamic planarity testing with applications. per Galil, Zvi

    Publicat a Journal of the ACM
    Article

    Fully dynamic planarity testing with applications.
  9. 1009

    Leader election in complete networks. per Singh, Gurdip

    Article

    Leader election in complete networks.
  10. 1010

    Tighter upper bounds on the exact complexity of string matching. per Cole, Richard

    Article

    Tighter upper bounds on the exact complexity of string matching.

Eines de cerca: