Search Results for ""

A problem is NP-hard if an algorithm for solving it can be translated into one for solving any NP-problem (nondeterministic polynomial time) problem. NP-hard therefore means ...

A nonuniform rational B-spline curve defined by C(t)=(sum_(i=0)^(n)N_(i,p)(t)w_iP_i)/(sum_(i=0)^(n)N_(i,p)(t)w_i), where p is the order, N_(i,p) are the B-spline basis ...

The upside-down capital delta symbol del , also called "del," used to denote the gradient and other vector derivatives. The following table summarizes the names and notations ...

The system of partial differential equations U_t = [V,W] (1) V_t = [W,U] (2) W_t = [U,V], (3) where [A,B] denotes the commutator.

A branch of mathematics which attempts to formalize the nature of the set using a minimal collection of independent axioms. Unfortunately, as discovered by its earliest ...

For b>a>0, 1/b<(lnb-lna)/(b-a)<1/a.

The integral transform defined by (Kphi)(x)=int_0^inftyG_(pq)^(mn)(xt|(a_p); (b_q))phi(t)dt, where G_(pq)^(mn) is a Meijer G-function. Note the lower limit of 0, not -infty ...

The Narayana triangle is the number triangle obtained from the Narayana numbers N(n,k), namely 1 ; 1 1 ; 1 3 1 ; 1 6 6 1 ; 1 10 20 10 1 ; 1 15 50 50 15 1 (OEIS A001263).

Two real algebraic manifolds are equivalent iff they are analytically homeomorphic (Nash 1952).

A theorem in game theory which guarantees the existence of a set of mixed strategies for finite, noncooperative games of two or more players in which no player can improve ...