Näytetään 781 - 790 yhteensä 1 181 tuloksesta haulle '"Complexity."', hakuaika: 0,02s Tarkenna hakua
  1. 781

    Complexity estimates depending on condition and round-off error. Tekijä Cucker, Felipe

    Julkaisussa Journal of the ACM
    Artikkeli

    Complexity estimates depending on condition and round-off error.
  2. 782

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

    Julkaisussa Journal of the ACM
    Artikkeli

    Probabilistic checking of proofs a new characterization of NP.
  3. 783

    Explicit OR-dispersers with polylogarithmic degree. Tekijä Saks, Michael

    Julkaisussa Journal of the ACM
    Artikkeli

    Explicit OR-dispersers with polylogarithmic degree.
  4. 784

    A new general derandomization method. Tekijä Andreev, Alexander E.

    Julkaisussa Journal of the ACM
    Artikkeli

    A new general derandomization method.
  5. 785

    Contention in shared memory algorithms. Tekijä Dwork, Cynthia

    Julkaisussa Journal of the ACM
    Artikkeli

    Contention in shared memory algorithms.
  6. 786

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

    Julkaisussa Journal of the ACM
    Artikkeli

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

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

    Julkaisussa Journal of the ACM
    Artikkeli

    Software reliability via run-time result-checking.
  8. 788

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

    Julkaisussa Journal of the ACM
    Artikkeli

    Sparsification-a technique for speeding up dynamic graph algorithms.
  9. 789

    How much can hardware help routing?. Tekijä Borodin, Allan

    Julkaisussa Journal of the ACM
    Artikkeli

    How much can hardware help routing?.
  10. 790

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

    Julkaisussa Journal of the ACM
    Artikkeli

    Time-work tradeoffs for parallel algorithms.

Työkalut: