Le calcul d'entier en précision multiple permet de s'affranchir de la limite imposés par les compilateurs pour le stockage des entiers.
Par exemple, en langage C, le plus grand entier est le long long int stocké sur 8 octets (valeur maximale de 264, environ 1,8x1019).
Portail de l’informatiqueWikimedia Foundation. 2010.
Contenu soumis à la licence CC-BY-SA. Source : Article Multi Precision Integer de Wikipédia en français (auteurs)
GNU Multi-Precision Library — Infobox Software name = GNU Multiple Precision Library caption = developer = The GNU Project latest release version = 4.2.4 latest release date = September 20, 2008 programming language = C operating system = Cross platform genre = Mathematical… … Wikipedia
Arbitrary-precision arithmetic — In computer science, arbitrary precision arithmetic indicates that calculations are performed on numbers whose digits of precision are limited only by the available memory of the host system. This contrasts with the faster fixed precision… … Wikipedia
MPI — Cette page d’homonymie répertorie les différents sujets et articles partageant un même nom. Sigles d’une seule lettre Sigles de deux lettres > Sigles de trois lettres Sigles de quatre lettres … Wikipédia en Français
Floating point — In computing, floating point describes a method of representing real numbers in a way that can support a wide range of values. Numbers are, in general, represented approximately to a fixed number of significant digits and scaled using an exponent … Wikipedia
DEC Alpha — Alpha Designer Digital Equipment Corporation Bits 64 bit Introduced 1992 Design RISC Type Register Register Encoding Fixed … Wikipedia
OCaml — Paradigm(s) multi paradigm: imperative, functional, object oriented Appeared in 1996 Developer INRIA Stable release 3.12.1 (July 4, 2011; 4 months ago ( … Wikipedia
Standard ML — Infobox programming language name = Standard ML logo = paradigm = multi paradigm: functional, imperative year = designer = typing = strong, static, inferred dialects = Alice, Dependent ML implementations = MLton, MLWorks, Moscow ML, Poly/ML,… … Wikipedia
Quadratic sieve — The quadratic sieve algorithm (QS) is a modern integer factorization algorithm and, in practice, the second fastest method known (after the general number field sieve). It is still the fastest for integers under 100 decimal digits or so, and is… … Wikipedia
Schönhage-Strassen algorithm — The Schönhage Strassen algorithm is an asymptotically fast multiplication algorithm for large integers. It was developed by Arnold Schönhage and Volker Strassen in 1971. [A. Schönhage and V. Strassen, Schnelle Multiplikation großer Zahlen ,… … Wikipedia
C (programming language) — C The C Programming Language[1] (aka K R ) is the seminal book on C … Wikipedia
