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

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

    Article

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

    Monotone real circuits are more powerful than monotone boolean circuits. by Rosenbloom, Arnold

    Article

    Monotone real circuits are more powerful than monotone boolean circuits.
  3. 773

    Linear complexity profiles and jump complexity. by Wang, M.Z

    Article

    Linear complexity profiles and jump complexity.
  4. 774

    On the effect of local changes in the variable ordering of ordered decision diagrams. by Bollig, Beate

    Article

    On the effect of local changes in the variable ordering of ordered decision diagrams.
  5. 775

    Succinct circuit representations and leaf language classes are basically the same concept. by Borchert, Bernd

    Article

    Succinct circuit representations and leaf language classes are basically the same concept.
  6. 776

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

    Published in Journal of the ACM
    Article

    An in-place sorting with O(nlog n) comparisons and O(n) moves.
  7. 777

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

    Published in Journal of the ACM
    Article

    Asymmetric k-center is log* n-hard to approximate.
  8. 778

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

    Published in Journal of the ACM
    Article

    Boosting textual compression in optimal linear time.
  9. 779

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

    Published in Journal of the ACM
    Article

    Edge-disjoint routing in plane switch graphs in linear time.
  10. 780

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

    Published in Journal of the ACM
    Article

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

Search Tools: