TOPICS
Search

Search Results for ""


211 - 220 of 359 for Reduced Error PruningSearch Results
An algebraic variety is a generalization to n dimensions of algebraic curves. More technically, an algebraic variety is a reduced scheme of finite type over a field K. An ...
Anomalous cancellation is a "canceling" of digits of a and b in the numerator and denominator of a fraction a/b which results in a fraction equal to the original. Note that ...
First stated in 1924, the Banach-Tarski paradox states that it is possible to decompose a ball into six pieces which can be reassembled by rigid motions to form two balls of ...
There are two definitions of the Carmichael function. One is the reduced totient function (also called the least universal exponent function), defined as the smallest integer ...
A set in R^n which can be reduced to one of its points, say P, by a continuous deformation, is said to be contractible. The transformation is such that each point of the set ...
A knot diagram is a picture of a projection of a knot onto a plane. Usually, only double points are allowed (no more than two points are allowed to be superposed), and the ...
A theorem, also known as Bachet's conjecture, which Bachet inferred from a lack of a necessary condition being stated by Diophantus. It states that every positive integer can ...
Using the notation of Byerly (1959, pp. 252-253), Laplace's equation can be reduced to (1) where alpha = cint_c^lambda(dlambda)/(sqrt((lambda^2-b^2)(lambda^2-c^2))) (2) = ...
A nonassociative algebra obeyed by objects such as the Lie bracket and Poisson bracket. Elements f, g, and h of a Lie algebra satisfy [f,f]=0 (1) [f+g,h]=[f,h]+[g,h], (2) and ...
A problem is assigned to the NP (nondeterministic polynomial time) class if it is solvable in polynomial time by a nondeterministic Turing machine. A P-problem (whose ...
1 ... 19|20|21|22|23|24|25 ... 36 Previous Next

...