Search Results for ""

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 ...

A connective in logic which yields true if any one of a sequence conditions is true, and false if all conditions are false. In formal logic, the term disjunction (or, more ...

A "squashed" spheroid for which the equatorial radius a is greater than the polar radius c, so a>c (called an oblate ellipsoid by Tietze 1965, p. 27). An oblate spheroid is a ...

"The" octahedral graph is the 6-node 12-edge Platonic graph having the connectivity of the octahedron. It is isomorphic to the circulant graph Ci_6(1,2), the cocktail party ...

A word is said to be overlapfree if it has no subwords of the form xyxyx. A squarefree word is overlapfree, and an overlapfree word is cubefree. The numbers t(n) of binary ...

Hadamard matrices H_n can be constructed using finite field GF(p^m) when p=4l-1 and m is odd. Pick a representation r relatively prime to p. Then by coloring white ...

A pentomino is a 5-polyomino. There are 12 free pentominoes, 18 one-sided pentominoes, and 63 fixed pentominoes. The twelve free pentominoes are known by the letters of the ...

Every nonconstant entire function attains every complex value with at most one exception (Henrici 1988, p. 216; Apostol 1997). Furthermore, every analytic function assumes ...

Two planes always intersect in a line as long as they are not parallel. Let the planes be specified in Hessian normal form, then the line of intersection must be ...

A point is a 0-dimensional mathematical object which can be specified in n-dimensional space using an n-tuple (x_1, x_2, ..., x_n) consisting of n coordinates. In dimensions ...