Search Results for ""

Partial evaluation is a branch of computer science studying program transformation via specialization. Any function can be specialized by fixing one or more of its inputs to ...

The total number of contravariant and covariant indices of a tensor. The rank R of a tensor is independent of the number of dimensions N of the underlying space. An intuitive ...

A genetic algorithm is a class of adaptive stochastic optimization algorithms involving search and optimization. Genetic algorithms were first used by Holland (1975). The ...

A special case of the quadratic Diophantine equation having the form x^2-Dy^2=1, (1) where D>0 is a nonsquare natural number (Dickson 2005). The equation x^2-Dy^2=+/-4 (2) ...

A face-centered cubic sphere packing obtained by placing layers of spheres one on top of another. Because there are two distinct ways to place each layer on top of the ...

A function f(x) is said to be constructible if some algorithm F computes it, in binary, within volume O(f(x)), i.e., V_(F(x))=O(f(x)). Here, the volume V_(A(x)) is the ...

A definition assigns properties to some sort of mathematical object. For example, Euclid's Elements starts with a number of definitions, such as "a line is a breadthless ...

A piecewise regular function that 1. Has a finite number of finite discontinuities and 2. Has a finite number of extrema can be expanded in a Fourier series which converges ...

The Gaussian joint variable theorem, also called the multivariate theorem, states that given an even number of variates from a normal distribution with means all 0, (1) etc. ...

The rank of a matrix or a linear transformation is the dimension of the image of the matrix or the linear transformation, corresponding to the number of linearly independent ...