TOPICS
Search

Search Results for ""


591 - 600 of 13134 for complexity theorySearch Results
In simple algebra, multiplication is the process of calculating the result when a number a is taken b times. The result of a multiplication is called the product of a and b, ...
The usual number of scalar operations (i.e., the total number of additions and multiplications) required to perform n×n matrix multiplication is M(n)=2n^3-n^2 (1) (i.e., n^3 ...
The set lambda of linear Möbius transformations w which satisfy w(t)=(at+b)/(ct+d), where a and d are odd and b and c are even. lambda is a subgroup of the modular group ...
The word residue is used in a number of different contexts in mathematics. Two of the most common uses are the complex residue of a pole, and the remainder of a congruence. ...
Let z=re^(itheta)=x+iy be a complex number, then inequality |(zexp(sqrt(1-z^2)))/(1+sqrt(1-z^2))|<=1 (1) holds in the lens-shaped region illustrated above. Written explicitly ...
The permanent is an analog of a determinant where all the signs in the expansion by minors are taken as positive. The permanent of a matrix A is the coefficient of x_1...x_n ...
An initial point that provides safe convergence of Newton's method (Smale 1981; Petković et al. 1997, p. 1).
There exists a total computable predicate P such that for any algorithm computing P(x) with running time T(x), there exists another algorithm computing P(x) with computation ...
Any finite semigroup is a divisor for an alternating wreath product of finite groups and semigroups.
A generalization of the Gaussian sum. For p and q of opposite parity (i.e., one is even and the other is odd), Schaar's identity states ...
1 ... 57|58|59|60|61|62|63 ... 1314 Previous Next

...