Search Results for ""
321 - 330 of 1205 for Shor's Algorithm ComplexitySearch Results
Let K be a finite complex, let h:|K|->|K| be a continuous map. If Lambda(h)!=0, then h has a fixed point.
A simplicial complex K is said to be locally finite if each vertex of K belongs only to finitely many simplices of K.
The unit lower half-disk is the portion of the complex plane satisfying {|z|<=1,I[z]<0}.
The simplicial complex formed from a family of objects by taking sets that have nonempty intersections.
The collection of twistors in Minkowski space that forms a four-dimensional complex vector space.
The unit upper half-disk is the portion of the complex plane satisfying {|z|<=1,I[z]>0}.
Let y_n be a complex number for 1<=n<=N and let y_n=0 if n<1 or n>N. Then (Montgomery 2001).
The average power of a complex signal f(t) as a function of time t is defined as <f^2(t)>=lim_(T->infty)1/(2T)int_(-T)^T|f(t)|^2dt, where |z| is the complex modulus (Papoulis ...
A complex rotation is a map of the form z|->ze^(itheta), where theta is a real number, which corresponds to counterclockwise rotation by theta radians about the origin of ...
The imaginary part I[z] of a complex number z=x+iy is the real number multiplying i, so I[x+iy]=y. In terms of z itself, I[z]=(z-z^_)/(2i), where z^_ is the complex conjugate ...
...


