Ports 搜索

LibTomMath provides highly optimized and portable routines for a vast majority of integer based number theoretic applications (including public key cryptography).

Developed by Jack Dongarra, Jim Bunch, Cleve Moler and Pete Stewart. 1 Feb 84 Used as part of Matlab, and often used to benchmark machines. Otherwise it is a very good linear algebra package.

This software calculates a normalized version of the classical spectral test for linear congruential pseudorandom number generators (LCGs), where the shortest vector is replaced by an approximation obtained with the Lenstra-Lenstra-Lovasz basis reduction algorithm, which can be calculated in polynomial time. The code is able to test in up to 24 dimensions, and includes an example of how to use the test to search for good LCG parameters.

lrng is a collection of uniform pseudorandom number generators, written in C, and based on algorithms by Francois Panneton, Pierre L'Ecuyer, and Makoto Matsumoto.

ltl2ba implements an algorithm of P. Gastin and D. Oddoux to generate Buechi automata from linear temporal logic (LTL) formulae. This algorithm generates a very weak alternating automaton and then transforms it into a Buechi automaton, using a generalized Buechi automaton as an intermediate step. Each automaton is simplified on-the-fly in order to save memory and time. As usual the LTL formula is simplified before any treatment. ltl2ba is more efficient than Spin 3.4.1, with regard to the size of the resulting automaton, the time of the computation, and the memory used.

basecalc came with Xlib Programming Manual from O'Reilly as an example of X lib programming. mbasecalc is an immitation of basecalc which is available on different platforms.

METIS is a set of serial programs for partitioning graphs, partitioning finite element meshes, and producing fill-reducing orderings for sparse matrices. The algorithms implemented in METIS are based on the multilevel recursive-bisection, multilevel k-way, and multi-constraint partitioning schemes developed in our lab. METIS provides high-quality partitions, is extremely fast, and produces low-fill orderings.

METIS is a set of serial programs for partitioning graphs, partitioning finite element meshes, and producing fill-reducing orderings for sparse matrices. The algorithms implemented in METIS are based on the multilevel recursive-bisection, multilevel k-way, and multi-constraint partitioning schemes developed in our lab. METIS provides high-quality partitions, is extremely fast, and produces low-fill orderings.

MPIR is an open source multiprecision integer (bignum) library forked from the GMP (GNU Multi Precision) project. It consists of much code from past GMP releases, in combination with much original contributed code. MPIR is constructed by a developer and vendor friendly community of professional and amateur mathematicians, computer scientists and hobbyists.

Msieve is a library and utility for factoring large integers using the most powerful modern algorithms. It features a stable and very fast implementation of a self-initializing multiple polynomial quadratic sieve (MPQS), plus a somewhat experimental general number field sieve (GNFS) implementation. Primary design goals are speed, portability and ease of use. Msieve claims to be the fastest implementation for factoring general inputs between 40 and 100 decimal digits, but can handle larger input as well.