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

A nonuniform rational B-spline surface of degree (p,q) is defined by ...

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

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

The Napoleon crossdifference is the crossdifference of the Napoleon points. It has triangle center function alpha_(1510)=((b^2-c^2)[2cos(2A)-1])/a and is Kimberling center ...

Given the center of a circle, divide the circle into four equal arcs using a compass alone (a Mascheroni construction).

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

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