Category:Shortcut

From Prime-Wiki
Jump to: navigation, search

This category contains all pages with shortcuts.

There're 19 entries.

Shortcut Explanation
APR Adleman–Pomerance–Rumely primality test: a prime testing algorithm.
APR-CL Adleman–Pomerance–Rumely Cohen-Lenstra Extended version: an improved APR prime testing algorithm.
AVX Advanced Vector Extensions: extensions to the x86 instructions of some newly CPUs.
BOINC Berkeley Open Infrastructure for Network Computing: platform running distributed computing projects.
CRUS Conjectures 'R Us: a Distributed computing project in search for lowest Sierpiński/Riesel values.
CPU Central Processing Unit: the main chip of a Computer.
CUDA Compute Unified Device Architecture: a parallel computing architecture developed by NVIDIA.
ECM Elliptic curve method: a factorization method.
FFT Fast Fourier transform: an efficient algorithm to compute the discrete Fourier transform.
GNFS General number field sieve: most efficient classical factoring method for 100+ digit numbers.
GPU Graphics processing unit: specialized microprocessor for graphics rendering.
GIMPS Great Internet Mersenne Prime Search: A distributed computing project for the search of Mersenne primes.
IBDWT Irrational base discrete weighted transform: a variant of the Fast Fourier transform using an irrational base.
LMH Lone Mersenne Hunters: trial factoring outside the normal range of exponents currently being assigned by PrimeNet
MPQS Multiple polynomial quadratic sieve: a factorization method.
PC Personal computer: any general-purpose computer.
PRP Probable prime: an integer that satisfies a specific condition also satisfied by all prime numbers.
SIQS Self-initializing quadratic sieve: a factorization method based on the Multiple polynomial quadratic sieve.
SNFS Special number field sieve: special-purpose factorization algorithm.
WU Work unit: a piece of work in a distributed computing project.

There're 19 entries.