Search Results for ""
8671 - 8680 of 8770 for Point Line Distance 3 DimensionalSearch Results
![](/common/images/search/spacer.gif)
The resolution principle, due to Robinson (1965), is a method of theorem proving that proceeds by constructing refutation proofs, i.e., proofs by contradiction. This method ...
The Rhind papyrus is a famous document from the Egyptian Middle Kingdom that dates to 1650 BC. It was purchased by Henry Rhind in Egypt in 1858, and placed in the British ...
The rising factorial x^((n)), sometimes also denoted <x>_n (Comtet 1974, p. 6) or x^(n^_) (Graham et al. 1994, p. 48), is defined by x^((n))=x(x+1)...(x+n-1). (1) This ...
Set covering deployment (sometimes written "set-covering deployment" and abbreviated SCDP for "set covering deployment problem") seeks an optimal stationing of troops in a ...
Skewness is a measure of the degree of asymmetry of a distribution. If the left tail (tail at small end of the distribution) is more pronounced than the right tail (tail at ...
In general, a triakis octahedron is a non-regular icositetrahedron that can be constructed as a positive augmentation of regular octahedron. Such a solid is also known as a ...
A spectral sequence is a tool of homological algebra that has many applications in algebra, algebraic geometry, and algebraic topology. Roughly speaking, a spectral sequence ...
Stratton (1935), Chu and Stratton (1941), and Rhodes (1970) define the spheroidal functions as those solutions of the differential equation (1) that remain finite at the ...
Let the stick number s(K) of a knot K be the least number of straight sticks needed to make a knot K. The smallest stick number of any knot is s(T)=6, where T is the trefoil ...
The theorem, originally conjectured by Berge (1960, 1961), that a graph is perfect iff neither the graph nor its graph complement contains an odd graph cycle of length at ...
![](/common/images/search/spacer.gif)
...