Ohcanbohtosat - "Analysis of algorithms."

Aiddostahte ozu
  1. 21

    Quantum lower bounds for the collision and the element distinctness problems. Dahkki Aaronson, Scott

    Publikašuvnnas Journal of the ACM
    Artihkal


    Bearbmagovva
  2. 22

    How much can hardware help routing?. Dahkki Borodin, Allan

    Publikašuvnnas Journal of the ACM
    Artihkal


    Bearbmagovva
  3. 23

    A unified approach to approximating resource allocation and scheduling. Dahkki Bar-Noy, Amotz

    Publikašuvnnas Journal of the ACM
    Artihkal


    Bearbmagovva
  4. 24

    Probabilistic checking of proofs a new characterization of NP. Dahkki Arora, Sanjeev

    Publikašuvnnas Journal of the ACM
    Artihkal


    Bearbmagovva
  5. 25

    Sparsification-a technique for speeding up dynamic graph algorithms. Dahkki Eppstein, David

    Publikašuvnnas Journal of the ACM
    Artihkal


    Bearbmagovva
  6. 26

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

    Publikašuvnnas Journal of the ACM
    Artihkal


    Bearbmagovva
  7. 27

    Polynomial-time data reduction for dominating set. Dahkki Alber, Jochen

    Publikašuvnnas Journal of the ACM
    Artihkal


    Bearbmagovva
  8. 28

    Smoothed analysis of algorithms Why the simplex algorithm usually takes polynomial time. Dahkki Spielman, Daniel A.

    Publikašuvnnas Journal of the ACM
    Artihkal


    Bearbmagovva
  9. 29

    Segmentation problems. Dahkki Kleinberg, Jon

    Publikašuvnnas Journal of the ACM
    Artihkal


    Bearbmagovva
  10. 30

    Existential second-order logic over graphs Charting the tractability frontier. Dahkki Gottlob, Georg

    Publikašuvnnas Journal of the ACM
    Artihkal


    Bearbmagovva

Ohcanreaiddut: