Search Results for ""

The Cayley-Purser algorithm is a public-key cryptography algorithm that relies on the fact that matrix multiplication is not commutative. It was devised by Sarah Flannery ...

The theory of classifying problems based on how difficult they are to solve. A problem is assigned to the P-problem (polynomial-time) class if the number of steps needed to ...

The confocal ellipsoidal coordinates, called simply "ellipsoidal coordinates" by Morse and Feshbach (1953) and "elliptic coordinates" by Hilbert and Cohn-Vossen (1999, p. ...

In the biconjugate gradient method, the residual vector r^((i)) can be regarded as the product of r^((0)) and an ith degree polynomial in A, i.e., r^((i))=P_i(A)r^((0)). (1) ...

The word "convergent" has a number of different meanings in mathematics. Most commonly, it is an adjective used to describe a convergent sequence or convergent series, where ...

Given a unit disk, find the smallest radius r(n) required for n equal disks to completely cover the unit disk. The first few such values are r(1) = 1 (1) r(2) = 1 (2) r(3) = ...

In combinatorial logic minimization, a device known as a Karnaugh map is frequently used. It is similar to a truth table, but the various variables are represented along two ...

A theorem outlined by Kolmogorov (1954) which was subsequently proved in the 1960s by Arnol'd (1963) and Moser (1962; Tabor 1989, p. 105). It gives conditions under which ...

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

Find the plane lamina of least area A which is capable of covering any plane figure of unit generalized diameter. A unit circle is too small, but a hexagon circumscribed on ...