Showing 1 - 4 results of 4 for search '"Combinatorial algorithms."', זמן שאילתה: 0.02s Refine Results
  1. 1

    Boosting textual compression in optimal linear time. מאת Ferragina, Paolo

    הוצא לאור ב Journal of the ACM
    Article

    Boosting textual compression in optimal linear time.
  2. 2

    Explicit OR-dispersers with polylogarithmic degree. מאת Saks, Michael

    הוצא לאור ב Journal of the ACM
    Article

    Explicit OR-dispersers with polylogarithmic degree.
  3. 3

    Almost tight upper bounds for vertical decompositions in four dimensions. מאת Koltun, Vladlen

    הוצא לאור ב Journal of the ACM
    Article

    Almost tight upper bounds for vertical decompositions in four dimensions.
  4. 4

    A combinatorial strongly polynomial algorithm for minimizing submodular functions. מאת Iwata, Satoru

    הוצא לאור ב Journal of the ACM
    Article

    A combinatorial strongly polynomial algorithm for minimizing submodular functions.

כלי חיפוש: