Showing 1,001 - 1,010 results of 1,181 for search '"Complexity."', query time: 0.02s Refine Results
  1. 1001

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

    Published in 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. by Lasserre, Jean B.

    Published in 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. by Hochbaum, Dorit S.

    Published in 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. by Holm, Jacob

    Published in 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. by Iwata, Satoru

    Published in Journal of the ACM
    Article

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

    Quantum lower bounds by polynomials. by Beals, Robert

    Published in Journal of the ACM
    Article

    Quantum lower bounds by polynomials.
  7. 1007

    Some optimal inapproximability results. by Håstad, Johan

    Published in Journal of the ACM
    Article

    Some optimal inapproximability results.
  8. 1008

    Fully dynamic planarity testing with applications. by Galil, Zvi

    Published in Journal of the ACM
    Article

    Fully dynamic planarity testing with applications.
  9. 1009

    Leader election in complete networks. by Singh, Gurdip

    Article

    Leader election in complete networks.
  10. 1010

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

    Article

    Tighter upper bounds on the exact complexity of string matching.

Search Tools: