Search Results for "big integer library"

opbdp is an implementation in C++ of an implicit enumeration algorithm for solving (non)linear 0-1 (or pseudo-Boolean) optimization problems with integer coefficients. A research report describing the techniques used in opbdp is included.

SLIMCPP is C++ header-only library that implements long integers that exceed maximum size of native type supported by a specific compiler by 2-4 times. All classes, methods and functions were not created or designed to work with huge numbers, for which there are specialized big integer mathematical libraries. In some cases, it is necessary to temporarily perform calculations with precision exceeding the maximum supported size of integers, and then return the result to its native size again.

ampclib is a simple to use platform independed C++ library for arithmetic multiple precision computations with a ritch and self explaining interface. It provides number theoretic functions and primality tests. The ampclib consists of three classes: +Integer (multiple precision integers) +Rational (multiple precision rational numbers using the Integer class) +Primes (prime number computations and number theoretic functions for unsigned 32 bit integers) The latest release contains optimizations and bug fixes.

NOMAD is a C++ code that implements the MADS algorithm (Mesh Adaptive Direct Search) for difficult blackbox optimization problems. Such problems occur when the functions to optimize are costly computer simulations with no derivatives.

Arageli is a C++ library for computations in arithmetic, algebra, geometry, linear and integer linear programming. Arageli provides routines and classes that support precise, i.e. symbolic or algebraic, computations.

The library computes the greatest common divisor of two univariate integer polynomials, whose coefficients are represented by multiple-precision integers provided by the GMP library. I wrote the code originally for CGAL, in 2007, but it was later removed for maintenance reasons.

MathX is a fixed-length arithmetic-types written in pure c++ templates. The goal is to provide signed-integer, unsigned-integer, IEEE-754 float-point and fixed-point types, all with specific number of bits. To this moment, only signed-integer and unsigned-integer are completed for little-endain architecture. Any compiler that support c++03 or c++11 can successfully compile MathX. Refer to README for more information.

MuPuPriNT (Multi-Purpose Prime Number Tester) is a primality and compositeness tester for many different types of numbers. It is basic, yet full-featured, and offers several different testing methods for each type of number. MuPuPriNT is built on the GNU Multiple-Precision (GMP) integer + rational library, and is available for Windows, OS X, and Linux. Source code is available as well, and can be built on any machine with Qt installed. As of version 2.0, MuPuPriNT is built on the cross-platform Qt application framework. There are currently two versions: MuPuPriNT and MuPuPriNT Extended.

If you are looking for the 64-bit version, find it here: http://sourceforge.net/projects/gjsieve/files/200/gjsieve203.exe/download GJSieve is a basic, yet full-featured sieve and tester for numbers of several classifications, including Proth, Cullen, and Woodall. GJSieve is built on the GNU Multiple-Precision (GMP) integer + rational library, and is available for both Windows and OSX. Currently, the application differs greatly across platforms. This may change in the future. They both, however, do the same thing.

This is module for basic computation with floating point numbers. Numbers can have very wide mantissa for good precision, for realize "arbitrary-precision arithmetic". Module was adapt for BCB and MSVC compilers. Russian comments.

MpNT is a multi-precision number theory library that provides a base for building cryptographic applications. It may however be used in any domain where efficient integer, modular, and floating-point computations involving large numbers are required.

This is a library of classes and functions to be used to abstract arbitrarily large integer and floating-point numbers in C++. All standard operators are overloaded so the user is able to substitute "mpi" for "int" and "mpf" for "double" to use.

Operation with currency values don't work fine with float or double types. This C++ library implements operators in a decimal fixed point (x100) package. This package use only integer type internally multiplied by 100.

Multiprecision unsigned number template library (MUNTL). The program is intended for the organization of calculations with the big precision for unsigned numbers. Program is very fast because do not use any heap call (new, malloc etc.)

XNum is an integer arithmetic library written in C++. The difference between XNum and other libraries such as GMP <http://www.swox.com/gmp/> is the the former tries to imitate the practical method that humans use to do the arithmetic themselves. Current

This STL-like C++ library contains classes for long integer numbers processing with using of assembler functions as a backend. Lazy evaluation is also used for optimization. It also contains generic implementation of classical number-theory algorithms.