Search Results for ""
631 - 640 of 13134 for complexity theorySearch Results
Tetrahedron picking is the process of picking tetrahedra at random within a given shape in 3 or higher dimensions. The most natural definition of a random tetrahedron is one ...
Transparallel processing refers to this search for regularities in O(2^N) strings as if only one string of length N were concerned (as is possible if the strings form a ...
A vector sum is the result of adding two or more vectors together via vector addition. It is denoted using the normal plus sign, i.e., the vector sum of vectors A, B, and C ...
An odd alternating permutation number, more commonly called an Euler number or secant number.
A generalized hypergeometric function _pF_q[alpha_1,alpha_2,...,alpha_p; beta_1,beta_2,...,beta_q;z], is said to be k-balanced if sum_(i=1)^qbeta_i=k+sum_(i=1)^palpha_i.
Presburger arithmetic is the first-order theory of the natural numbers containing addition but no multiplication. It is therefore not as powerful as Peano arithmetic. ...
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" Jacobi identity is a relationship [A,[B,C]]+[B,[C,A]]+[C,[A,B]]=0,, (1) between three elements A, B, and C, where [A,B] is the commutator. The elements of a Lie algebra ...
The reciprocal of the arithmetic-geometric mean of 1 and sqrt(2), G = 2/piint_0^11/(sqrt(1-x^4))dx (1) = 2/piint_0^(pi/2)(dtheta)/(sqrt(1+sin^2theta)) (2) = L/pi (3) = ...
An extremely fast factorization method developed by Pollard which was used to factor the RSA-130 number. This method is the most powerful known for factoring general numbers, ...
...
View search results from all Wolfram sites (28442 matches)

