Search Results for ""

An algorithm that can be used to factor a polynomial f over the integers. The algorithm proceeds by first factoring f modulo a suitable prime p via Berlekamp's method and ...

The proposal originally made by Georg Cantor that there is no infinite set with a cardinal number between that of the "small" infinite set of integers aleph_0 and the "large" ...

The Bron-Kerbosch algorithm is an efficient method for finding all maximal cliques in a graph.

An algorithm for computing an Egyptian fraction, called the Farey sequence method by Bleicher (1972).

The Lebesgue measure is an extension of the classical notions of length and area to more complicated sets. Given an open set S=sum_(k)(a_k,b_k) containing disjoint intervals, ...

In common usage, an ordinal number is an adjective which describes the numerical position of an object, e.g., first, second, third, etc. In formal set theory, an ordinal ...

A stochastic approximation method that functions by placing conditions on iterative step sizes and whose convergence is guaranteed under mild conditions. However, the method ...

Let (A,<=) be a well ordered set. Then the set {a in A:a<k} for some k in A is called an initial segment of A (Rubin 1967, p. 161; Dauben 1990, pp. 196-197; Moore 1982, pp. ...

The primes with Legendre symbol (n/p)=1 (less than N=pi(d) for trial divisor d) which need be considered when using the quadratic sieve factorization method.

Differential evolution is a stochastic parallel direct search evolution strategy optimization method that is fairly fast and reasonably robust. Differential evolution is ...