Search Results for ""

The Hungarian algorithm finds a maximum independent edge set on a graph. The algorithm starts with any matching M and constructs a tree via a breadth-first search to find an ...

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 ...

Porter's constant is the constant appearing in formulas for the efficiency of the Euclidean algorithm, C = (6ln2)/(pi^2)[3ln2+4gamma-(24)/(pi^2)zeta^'(2)-2]-1/2 (1) = ...

For n>=1, let u and v be integers with u>v>0 such that the Euclidean algorithm applied to u and v requires exactly n division steps and such that u is as small as possible ...

A method for computing an Egyptian fraction. This method always terminates (Beeckmans 1993).

For a catastrophically unstable recurrence in one direction, any seed values for consecutive x_j and x_(j+1) will converge to the desired sequence of functions in the ...

Branch and bound algorithms are a variety of adaptive partition strategies have been proposed to solve global optimization models. These are based upon partition, sampling, ...

A reduction system is said to posses the Church-Rosser property if, for all x and y such that x<->_*y, there exists a z such that x->_*z and y->_*z. A reduction system is ...

Let x->y and u->v be two rules of a term rewriting system, and suppose these rules have no variables in common. If they do, rename the variables. If x_1 is a subterm of x (or ...

A strict order > on the set of terms of a term rewriting system is called a reduction order if 1. The set of terms is well ordered with respect to >, that is, all its ...