Search Results for ""
751 - 760 of 13134 for complexity theorySearch Results
Also called Chvátal's art gallery theorem. If the walls of an art gallery are made up of n straight line segments, then the entire gallery can always be supervised by |_n/3_| ...
When the index nu is real, the functions J_nu(z), J_nu^'(z), Y_nu(z), and Y_nu^'(z) each have an infinite number of real zeros, all of which are simple with the possible ...
The Hilbert curve is a Lindenmayer system invented by Hilbert (1891) whose limit is a plane-filling function which fills a square. Traversing the polyhedron vertices of an ...
A polyomino tiling is a tiling of the plane by specified types of polyominoes. Tiling by polyominoes has been investigated since at least the late 1950s, particularly by S. ...
Let K be a number field with r_1 real embeddings and 2r_2 imaginary embeddings and let r=r_1+r_2-1. Then the multiplicative group of units U_K of K has the form ...
Two graphs which contain the same number of graph vertices connected in the same way are said to be isomorphic. Formally, two graphs G and H with graph vertices ...
The number obtained by adding the reciprocals of the odd twin primes, B=(1/3+1/5)+(1/5+1/7)+(1/(11)+1/(13))+(1/(17)+1/(19))+.... (1) By Brun's theorem, the series converges ...
A graph embedding, sometimes also called a graph drawing, is a particular drawing of a graph. Graph embeddings are most commonly drawn in the plane, but may also be ...
Linear programming, sometimes known as linear optimization, is the problem of maximizing or minimizing a linear function over a convex polyhedron specified by linear and ...
Q(n), also denoted q(n) (Abramowitz and Stegun 1972, p. 825), gives the number of ways of writing the integer n as a sum of positive integers without regard to order with the ...
...
View search results from all Wolfram sites (28442 matches)

