Search Results for ""
961 - 970 of 1205 for Shor's Algorithm ComplexitySearch Results
The elliptic lambda function lambda(tau) is a lambda-modular function defined on the upper half-plane by lambda(tau)=(theta_2^4(0,q))/(theta_3^4(0,q)), (1) where tau is the ...
The Hadwiger number of a graph G, variously denoted eta(G) (Zelinka 1976, Ivančo 1988) or h(G) (Stiebitz 1990), is the number of vertices in the largest complete minor of G ...
The Hilbert curve is a Lindenmayer system invented by Hilbert (1891) whose limit is a plane-filling function which fills a square. Traversing the polyhedron vertices of an ...
Jacobi's imaginary transformations relate elliptic functions to other elliptic functions of the same type but having different arguments. In the case of the Jacobi elliptic ...
Let omega_1 and omega_2 be periods of a doubly periodic function, with tau=omega_2/omega_1 the half-period ratio a number with I[tau]!=0. Then Klein's absolute invariant ...
A Lambert series is a series of the form F(x)=sum_(n=1)^inftya_n(x^n)/(1-x^n) (1) for |x|<1. Then F(x) = sum_(n=1)^(infty)a_nsum_(m=1)^(infty)x^(mn) (2) = ...
The Lovász number theta(G) of a graph G, sometimes also called the theta function of G, was introduced by Lovász (1979) with the explicit goal of estimating the Shannon ...
The quantities obtained from cubic, hexagonal, etc., lattice sums, evaluated at s=1, are called Madelung constants. For cubic lattice sums ...
Roughly speaking, a matroid is a finite set together with a generalization of a concept from linear algebra that satisfies a natural set of properties for that concept. For ...
A polyomino tiling is a tiling of the plane by specified types of polyominoes. Tiling by polyominoes has been investigated since at least the late 1950s, particularly by S. ...
...
View search results from all Wolfram sites (13084 matches)

