Search Results for ""
171 - 180 of 923 for Euclidean AlgorithmSearch Results
A hyperbolic version of the Euclidean dodecahedron. Hyperbolic three-space can be tessellated with hyperbolic dodecahedra whose intermediate dihedral angles are 60, 72, or 90 ...
All Euclidean geometric constructions can be carried out with a straightedge alone if, in addition, one is given the radius of a single circle and its center. The theorem was ...
An example of a subspace of the Euclidean plane that is connected but not pathwise-connected with respect to the relative topology. It is formed by the ray y=0, x<=0 and the ...
A global extremum, also known as an absolute extremum, is a global minimum or global maximum. It is impossible to construct an algorithm that will find a global extremum for ...
A global maximum, also known as an absolute maximum, the largest overall value of a set, function, etc., over its entire range. It is impossible to construct an algorithm ...
A global minimum, also known as an absolute minimum, is the smallest overall value of a set, function, etc., over its entire range. It is impossible to construct an algorithm ...
A prime factorization algorithm in which a sequence of trial divisors is chosen using a quadratic sieve. By using quadratic residues of N, the quadratic residues of the ...
A popular acronym for "principal ideal domain." In engineering circles, the acronym PID refers to the "proportional-integral-derivative method" algorithm for controlling ...
In random number computation, a seed is an initial number used as the starting point in a random number generating algorithm. In a dynamical system, a seed is a starting ...
A vector space V is a set that is closed under finite vector addition and scalar multiplication. The basic example is n-dimensional Euclidean space R^n, where every element ...
...
View search results from all Wolfram sites (9978 matches)

