Search Results for ""

The blossom algorithm (Edmonds 1965) finds a maximum independent edge set in a (possibly weighted) graph. While a maximum independent edge set can be found fairly easily for ...

A prime factorization algorithm which uses residues produced in the continued fraction of sqrt(mN) for some suitably chosen m to obtain a square number. The algorithm solves ...

An algorithm for partitioning (or clustering) N data points into K disjoint subsets S_j containing N_j data points so as to minimize the sum-of-squares criterion ...

An algorithm for finding a graph's spanning tree of minimum length. It sorts the edges of a graph in order of increasing cost and then repeatedly adds edges that bridge ...

A lattice reduction algorithm, named after discoverers Lenstra, Lenstra, and Lovasz (1982), that produces a lattice basis of "short" vectors. It was noticed by Lenstra et al. ...

The process of finding a reduced set of basis vectors for a given lattice having certain special properties. Lattice reduction algorithms are used in a number of modern ...

pi may be computed using a number of iterative algorithms. The best known such algorithms are the Archimedes algorithm, which was derived by Pfaff in 1800, and the ...

The Chu-Vandermonde identity _2F_1(-n,b;c;1)=((c-b)_n)/((c)_n) (1) (for n in Z^+) is a special case of Gauss's hypergeometric theorem _2F_1(a,b;c;1) = ((c-b)_(-a))/((c)_(-a)) ...

Saalschütz's theorem is the generalized hypergeometric function identity _3F_2[a,b,-n; c,1+a+b-c-n;1]=((c-a)_n(c-b)_n)/((c)_n(c-a-b)_n) (1) which holds for n a nonnegative ...

An algorithm which extrapolates the partial sums s_n of a series sum_(n)a_n whose convergence is approximately geometric and accelerates its rate of convergence. The ...