Résultat(s) 1 - 6 résultats de 6 pour la requête '"Numerical algorithms and problems."', Temps de recherche: 0,02s Affiner les résultats
  1. 1

    The calculus formally known as pi. par Kelly-Bootle, Stan

    Article

    The calculus formally known as pi.
  2. 2

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

    Publié dans Journal of the ACM
    Article

    Software reliability via run-time result-checking.
  3. 3

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

    Publié dans Journal of the ACM
    Article

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

    Lower bounds on the bounded coefficient complexity of bilinear maps. par Bürgisser, Peter

    Publié dans Journal of the ACM
    Article

    Lower bounds on the bounded coefficient complexity of bilinear maps.
  5. 5

    The security of all RSA and discrete log bits. par Håstad, Johan

    Publié dans Journal of the ACM
    Article

    The security of all RSA and discrete log bits.
  6. 6

    A Laplace transform algorithm for the volume of a convex polytope. par Lasserre, Jean B.

    Publié dans Journal of the ACM
    Article

    A Laplace transform algorithm for the volume of a convex polytope.

Outils de recherche: