Showing 21 - 30 results of 85 for search '"Analysis of algorithms and problem complexity."', सवाल का समय: 0.02सेकंड परिणाम को परिष्कृत करें
  1. 21

    A new general derandomization method. द्वारा Andreev, Alexander E.

    में प्रकाशित Journal of the ACM
    लेख

    A new general derandomization method.
  2. 22

    Contention in shared memory algorithms. द्वारा Dwork, Cynthia

    में प्रकाशित Journal of the ACM
    लेख

    Contention in shared memory algorithms.
  3. 23

    Exact analysis of Dodgson elections Lewis Carroll's 1876 voting system is complete for parallel access to NP. द्वारा Hemaspaandra, Edith

    में प्रकाशित Journal of the ACM
    लेख

    Exact analysis of Dodgson elections Lewis Carroll's 1876 voting system is complete for parallel access to NP.
  4. 24

    Software reliability via run-time result-checking. द्वारा Wasserman, Hal

    में प्रकाशित Journal of the ACM
    लेख

    Software reliability via run-time result-checking.
  5. 25

    Sparsification-a technique for speeding up dynamic graph algorithms. द्वारा Eppstein, David

    में प्रकाशित Journal of the ACM
    लेख

    Sparsification-a technique for speeding up dynamic graph algorithms.
  6. 26

    How much can hardware help routing?. द्वारा Borodin, Allan

    में प्रकाशित Journal of the ACM
    लेख

    How much can hardware help routing?.
  7. 27

    Time-work tradeoffs for parallel algorithms. द्वारा Spencer, Thomas H.

    में प्रकाशित Journal of the ACM
    लेख

    Time-work tradeoffs for parallel algorithms.
  8. 28

    Polynomial-time data reduction for dominating set. द्वारा Alber, Jochen

    में प्रकाशित Journal of the ACM
    लेख

    Polynomial-time data reduction for dominating set.
  9. 29

    Smoothed analysis of algorithms Why the simplex algorithm usually takes polynomial time. द्वारा Spielman, Daniel A.

    में प्रकाशित Journal of the ACM
    लेख

    Smoothed analysis of algorithms Why the simplex algorithm usually takes polynomial time.
  10. 30

    Lower bounds on the bounded coefficient complexity of bilinear maps. द्वारा Bürgisser, Peter

    में प्रकाशित Journal of the ACM
    लेख

    Lower bounds on the bounded coefficient complexity of bilinear maps.

खोज साधन: