Search Results for ""
691 - 700 of 1205 for Shor's Algorithm ComplexitySearch Results
The E_n(x) function is defined by the integral E_n(x)=int_1^infty(e^(-xt)dt)/(t^n) (1) and is given by the Wolfram Language function ExpIntegralE[n, x]. Defining t=eta^(-1) ...
Endraß surfaces are a pair of octic surfaces which have 168 ordinary double points. This is the maximum number known to exist for an octic surface, although the rigorous ...
An Enriques surface X is a smooth compact complex surface having irregularity q(X)=0 and nontrivial canonical sheaf K_X such that K_X^2=O_X (Endraß). Such surfaces cannot be ...
The Epstein zeta function for a n×n matrix S of a positive definite real quadratic form and rho a complex variable with R[rho]>n/2 (where R[z] denotes the real part) is ...
A field K is said to be an extension field (or field extension, or extension), denoted K/F, of a field F if F is a subfield of K. For example, the complex numbers are an ...
Let Q(x) be a real or complex piecewise-continuous function defined for all values of the real variable x and that is periodic with minimum period pi so that Q(x+pi)=Q(x). ...
The Fourier transform is a generalization of the complex Fourier series in the limit as L->infty. Replace the discrete A_n with the continuous F(k)dk while letting n/L->k. ...
Fuglede (1974) conjectured that a domain Omega admits an operator spectrum iff it is possible to tile R^d by a family of translates of Omega. Fuglede proved the conjecture in ...
The fundamental theorem of arithmetic states that every positive integer (except the number 1) can be represented in exactly one way apart from rearrangement as a product of ...
A Gaussian integer is a complex number a+bi where a and b are integers. The Gaussian integers are members of the imaginary quadratic field Q(sqrt(-1)) and form a ring often ...
...
View search results from all Wolfram sites (13084 matches)

