Search Results for ""

A random matrix is a matrix of given type and size whose entries consist of random numbers from some specified distribution. Random matrix theory is cited as one of the ...

Let S be a collection of subsets of a finite set X. A subset Y of X that meets every member of S is called the vertex cover, or hitting set. A vertex cover of a graph G can ...

A secant line, also simply called a secant, is a line passing through two points of a curve. As the two points are brought together (or, more precisely, as one is brought ...

Tarski's theorem says that the first-order theory of reals with +, *, =, and > allows quantifier elimination. Algorithmic quantifier elimination implies decidability assuming ...

The Thomson problem is to determine the stable equilibrium positions of n classical electrons constrained to move on the surface of a sphere and repelling each other by an ...

A nonlinear deconvolution technique used in deconvolving images from the Hubble Space Telescope before corrective optics were installed.

A public-key cryptography algorithm which uses prime factorization as the trapdoor one-way function. Define n=pq (1) for p and q primes. Also define a private key d and a ...

A Bäcklund transformation allows additional solutions to a nonlinear partial differential equations to be found if one particular solution is already known.

For the hyperbolic partial differential equation u_(xy) = F(x,y,u,p,q) (1) p = u_x (2) q = u_y (3) on a domain Omega, Goursat's problem asks to find a solution u(x,y) of (3) ...

A type of cryptography in which the encoding key is revealed without compromising the encoded message. The two best-known methods are the knapsack problem and RSA encryption.