Showing 31 - 40 results of 97 for search '"Problem complexity."', query time: 0.02s Refine Results
  1. 31

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

    Published in Journal of the ACM
    Article

    Probabilistic checking of proofs a new characterization of NP.
  2. 32

    A new general derandomization method. by Andreev, Alexander E.

    Published in Journal of the ACM
    Article

    A new general derandomization method.
  3. 33

    Contention in shared memory algorithms. by Dwork, Cynthia

    Published in Journal of the ACM
    Article

    Contention in shared memory algorithms.
  4. 34

    Exact analysis of Dodgson elections Lewis Carroll's 1876 voting system is complete for parallel access to NP. by Hemaspaandra, Edith

    Published in Journal of the ACM
    Article

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

    Software reliability via run-time result-checking. by Wasserman, Hal

    Published in Journal of the ACM
    Article

    Software reliability via run-time result-checking.
  6. 36

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

    Published in Journal of the ACM
    Article

    Sparsification-a technique for speeding up dynamic graph algorithms.
  7. 37

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

    Published in Journal of the ACM
    Article

    How much can hardware help routing?.
  8. 38

    Time-work tradeoffs for parallel algorithms. by Spencer, Thomas H.

    Published in Journal of the ACM
    Article

    Time-work tradeoffs for parallel algorithms.
  9. 39

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

    Published in Journal of the ACM
    Article

    Polynomial-time data reduction for dominating set.
  10. 40

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

    Published in Journal of the ACM
    Article

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

Search Tools: