Εμφανίζονται 17.361 - 17.370 Αποτελέσματα από 18.422 για την αναζήτηση '"mathematics"', χρόνος αναζήτησης: 0,06δλ Περιορισμός αποτελεσμάτων
  1. 17361

    A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. ανά Jerrum, Mark

    Τόπος έκδοσης Journal of the ACM
    Άρθρο

    A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
  2. 17362

    Software verification and validation with destiny a parallel approach to automated theorem proving. ανά Dykstra, Josiah

    Τόπος έκδοσης Crossroads : the ACM student magazine.
    Άρθρο

    Software verification and validation with destiny a parallel approach to automated theorem proving.
  3. 17363

    Complexity estimates depending on condition and round-off error. ανά Cucker, Felipe

    Τόπος έκδοσης Journal of the ACM
    Άρθρο

    Complexity estimates depending on condition and round-off error.
  4. 17364

    Relational expressive power of constraint query languages. ανά Benedikt, Michael

    Τόπος έκδοσης Journal of the ACM
    Άρθρο

    Relational expressive power of constraint query languages.
  5. 17365

    Probabilistic checking of proofs a new characterization of NP. ανά Arora, Sanjeev

    Τόπος έκδοσης Journal of the ACM
    Άρθρο

    Probabilistic checking of proofs a new characterization of NP.
  6. 17366

    Explicit OR-dispersers with polylogarithmic degree. ανά Saks, Michael

    Τόπος έκδοσης Journal of the ACM
    Άρθρο

    Explicit OR-dispersers with polylogarithmic degree.
  7. 17367

    Theory of neuromata. ανά íma, Jiří

    Τόπος έκδοσης Journal of the ACM
    Άρθρο

    Theory of neuromata.
  8. 17368

    A new general derandomization method. ανά Andreev, Alexander E.

    Τόπος έκδοσης Journal of the ACM
    Άρθρο

    A new general derandomization method.
  9. 17369

    Corrigendum Reasoning about knowledge and probability?. ανά Fagin, Ronald

    Τόπος έκδοσης Journal of the ACM
    Άρθρο

    Corrigendum Reasoning about knowledge and probability?.
  10. 17370

    Sparsification-a technique for speeding up dynamic graph algorithms. ανά Eppstein, David

    Τόπος έκδοσης Journal of the ACM
    Άρθρο

    Sparsification-a technique for speeding up dynamic graph algorithms.

Εργαλεία αναζήτησης: