Search Results for ""

A problem which is both NP (verifiable in nondeterministic polynomial time) and NP-hard (any NP-problem can be translated into this problem). Examples of NP-hard problems ...

A type of mathematical result which is considered by most logicians as more natural than the metamathematical incompleteness results first discovered by Gödel. Finite ...

Polynomials O_n(x) that can be defined by the sum O_n(x)=1/4sum_(k=0)^(|_n/2_|)(n(n-k-1)!)/(k!)(1/2x)^(2k-n-1) (1) for n>=1, where |_x_| is the floor function. They obey the ...

A paradox in decision theory. Given two boxes, B1 which contains $1000 and B2 which contains either nothing or a million dollars, you may pick either B2 or both. However, at ...

The noncentral chi-squared distribution with noncentrality parameter lambda is given by P_r(x) = ...

A *-algebra A of operators on a Hilbert space H is said to act nondegenerately if whenever Txi=0 for all T in A, it necessarily implies that xi=0. Algebras A which act ...

The word "normal form" is used in a variety of different ways in mathematics. In general, it refers to a way of representing objects so that, although each may have many ...

Physicists and engineers use the phrase "order of magnitude" to refer to the smallest power of ten needed to represent a quantity. Two quantities A and B which are within ...

Ore algebra is an algebra of noncommutative polynomials representing linear operators for functional equations such as linear differential or difference equations. Ore ...

The P versus NP problem is the determination of whether all NP-problems are actually P-problems. If P and NP are not equivalent, then the solution of NP-problems requires (in ...