TOPICS
Search

Search Results for ""


281 - 290 of 1205 for Shor's Algorithm ComplexitySearch Results
Given a polynomial in a single complex variable with complex coefficients p(z)=a_nz^n+a_(n-1)z^(n-1)+...+a_0, the reciprocal polynomial is defined by ...
The convex hull of a set of points S in n dimensions is the intersection of all convex sets containing S. For N points p_1, ..., p_N, the convex hull C is then given by the ...
The Dirichlet beta function is defined by the sum beta(x) = sum_(n=0)^(infty)(-1)^n(2n+1)^(-x) (1) = 2^(-x)Phi(-1,x,1/2), (2) where Phi(z,s,a) is the Lerch transcendent. The ...
The set A^2 of all ordered pairs of complex numbers.
A cellular space is a T2-space that has the structure of a so-called CW-complex.
The portion of the complex plane z=x+iy with real part R[z]<0.
The portion of the complex plane z=x+iy with real part R[z]>0.
Ai(z) and Ai^'(z) have zeros on the negative real axis only. Bi(z) and Bi^'(z) have zeros on the negative real axis and in the sector pi/3<|argz|<pi/2. The nth (real) roots ...
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 ...
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, ...
1 ... 26|27|28|29|30|31|32 ... 121 Previous Next

...