Search Results for ""

An algorithm for finding integer relations whose running time is bounded by a polynomial in the number of real variables (Ferguson and Bailey 1992). Unfortunately, it is ...

An algorithm for computing an Egyptian fraction.

An algorithm which constructs allowed mathematical statements from simple ingredients.

A spigot algorithm is an algorithm which generates digits of a quantity one at a time without using or requiring previously computed digits. Amazingly, spigot algorithms are ...

The algorithm for the construction of a Gröbner basis from an arbitrary ideal basis. Buchberger's algorithm relies on the concepts of S-polynomial and polynomial reduction ...

The so-called reaching algorithm can solve the shortest path problem (i.e., the problem of finding the graph geodesic between two given nodes) on an m-edge graph in O(m) ...

An algorithm which finds the least nonnegative value of sqrt(a (mod p)) for given a and prime p.

An elegant algorithm for constructing an Eulerian cycle (Skiena 1990, p. 193).

An algorithm for computing the eigenvalues and eigenvectors for large symmetric sparse matrices.

The Bellman-Ford algorithm is an algorithm for solving the shortest path problem, i.e., finding a graph geodesic between two given vertices. Other algorithms that can be used ...