Search Results for ""
7041 - 7050 of 13134 for complexity theorySearch Results
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 glome is a 4-sphere (in the geometer's sense of the word) x^2+y^2+z^2+w^2=r^2 (as opposed to the usual 3-sphere). The term derives from the Latin "glomus" meaning "ball of ...
The term "God's number" is sometimes given to the graph diameter of Rubik's graph, which is the minimum number of turns required to solve a Rubik's cube from an arbitrary ...
The discontinuous solution of the surface of revolution area minimization problem for surfaces connecting two circles. When the circles are sufficiently far apart, the usual ...
Regardless of where one white and one black square are deleted from an ordinary 8×8 chessboard, the reduced board can always be covered exactly with 31 dominoes (of dimension ...
A binomial coefficient (N; k) with k>=2 is called good if its least prime factor satisfies lpf(N; k)>k (Erdős et al. 1993). This is equivalent to the requirement that GCD((N; ...
Another name for the confluent hypergeometric function of the second kind, defined by where Gamma(x) is the gamma function and _1F_1(a;b;z) is the confluent hypergeometric ...
A decomposition of a module into a direct sum of submodules. The index set for the collection of submodules is then called the grading set. Graded modules arise naturally in ...
...
View search results from all Wolfram sites (28442 matches)

