Erakusten 1 - 4 emaitzak -- 4 bilaketa honetara '"Combinatorial algorithms."', Bilaketaren denbora: 0,02s Findu emaitzak
  1. 1

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

    Argitaratua izan da Journal of the ACM
    Artikulua

    Boosting textual compression in optimal linear time.
  2. 2

    Explicit OR-dispersers with polylogarithmic degree. nork Saks, Michael

    Argitaratua izan da Journal of the ACM
    Artikulua

    Explicit OR-dispersers with polylogarithmic degree.
  3. 3

    Almost tight upper bounds for vertical decompositions in four dimensions. nork Koltun, Vladlen

    Argitaratua izan da Journal of the ACM
    Artikulua

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

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

    Argitaratua izan da Journal of the ACM
    Artikulua

    A combinatorial strongly polynomial algorithm for minimizing submodular functions.

Bilaketa egiteko lanabesak: