gmp

GMP is a free library for arbitrary precision arithmetic, operating on signed integers, rational numbers, and floating point numbers. There is no practical limit to the precision except the ones implied by the available memory in the machine GMP runs on. GMP has a rich set of functions, and the functions have a regular interface. The main target applications for GMP are cryptography applications and research, Internet security applications, algebra systems, computational algebra research, etc. GMP is carefully designed to be as fast as possible, both for small operands and for huge operands. The speed is achieved by using fullwords as the basic arithmetic type, by using fast algorithms, with highly optimised assembly code for the most common inner loops for a lot of CPUs, and by a general emphasis on speed. The first GMP release was made in 1991. It is continually developed and maintained, with a new release about once a year. GMP is distributed under the GNU LGPL. This license makes the library free to use, share, and improve, and allows you to pass on the result. The license gives freedoms, but also sets firm restrictions on the use with non-free programs. GMP is part of the GNU project. For more information about the GNU project, please see the official GNU web site. GMP’s main target platforms are Unix-type systems, such as GNU/Linux, Solaris, HP-UX, Mac OS X/Darwin, BSD, AIX, etc. It also is known to work on Windows in both 32-bit and 64-bit mode.


References in zbMATH (referenced in 202 articles )

Showing results 1 to 20 of 202.
Sorted by year (citations)

1 2 3 ... 9 10 11 next

  1. Scott, Michael: Missing a trick: Karatsuba variations (2018)
  2. Akaiwa, Kanae; Nakamura, Yoshimasa; Iwasaki, Masashi; Yoshida, Akira; Kondo, Koichi: An arbitrary band structure construction of totally nonnegative matrices with prescribed eigenvalues (2017)
  3. Anders Jensen, Jeff Sommars, Jan Verschelde: Computing Tropical Prevarieties in Parallel (2017) arXiv
  4. Assarf, Benjamin; Gawrilow, Ewgenij; Herr, Katrin; Joswig, Michael; Lorenz, Benjamin; Paffenholz, Andreas; Rehn, Thomas: Computing convex hulls and counting integer points with polymake (2017)
  5. Carbó-Dorca, Ramon; Muñoz-Caro, Camelia; Niño, Alfonso; Reyes, Sebastián: Refinement of a generalized Fermat’s last theorem conjecture in natural vector spaces (2017)
  6. Claus Fieker, William Hart, Tommy Hofmann, Fredrik Johansson: Nemo/Hecke: Computer Algebra and Number Theory Packages for the Julia Programming Language (2017) arXiv
  7. David Kahle, Christopher O’Neill, Jeff Sommars: A computer algebra system for R: Macaulay2 and the m2r package (2017) arXiv
  8. Escobedo, Adolfo R.; Moreno-Centeno, Erick: Roundoff-error-free basis updates of LU factorizations for the efficient validation of optimality certificates (2017)
  9. Farmer, Michael; Loizou, George; Maybank, Stephen: Iteration functions re-visited (2017)
  10. Genkin, Daniel; Shamir, Adi; Tromer, Eran: Acoustic cryptanalysis (2017)
  11. Gu, Yijia; Wahl, Thomas: Stabilizing floating-point programs using provenance analysis (2017)
  12. Hehn, Andreas; van Well, Natalija; Troyer, Matthias: High-temperature series expansion for spin-1/2 Heisenberg models (2017)
  13. Jones, Robert Stephen: Computing ultra-precise eigenvalues of the Laplacian within polygons (2017)
  14. Kamihigashi, Takashi: 41 counterexamples to property (B) of the discrete time bomber problem (2017)
  15. Kehlet, Benjamin; Logg, Anders: A posteriori error analysis of round-off errors in the numerical solution of ordinary differential equations (2017)
  16. Khandaker, Md.Al-Amin; Ono, Hirotaka; Nogami, Yasuyuki; Shirase, Masaaki; Duquesne, Sylvain: An improvement of optimal ate pairing on KSS curve with pseudo 12-sparse multiplication (2017)
  17. Martins, Paulo; Sousa, Leonel: Enhancing data parallelism of fully homomorphic encryption (2017)
  18. Stanislav Poslavsky: Rings: an efficient Java/Scala library for polynomial rings (2017) arXiv
  19. Toth, Csaba D. (ed.); Goodman, Jacob E. (ed.); O’Rourke, Joseph (ed.): Handbook of discrete and computational geometry (2017)
  20. Bangay, Shaun; Beliakov, Gleb: On the fast Lanczos method for computation of eigenvalues of Hankel matrices using multiprecision arithmetics. (2016)

1 2 3 ... 9 10 11 next