Search Results for ""

Deciding whether a given Boolean formula in conjunctive normal form has an assignment that makes the formula "true." In 1971, Cook showed that the problem is NP-complete.

A root-finding algorithm based on the iteration formula x_(n+1)=x_n-(f(x_n))/(f^'(x_n)){1+(f(x_n)f^('')(x_n))/(2[f^'(x_n)]^2)}. This method, like Newton's method, has poor ...

A formula for numerical integration, (1) where C_(2n) = sum_(i=0)^(n)f_(2i)cos(tx_(2i))-1/2[f_(2n)cos(tx_(2n))+f_0cos(tx_0)] (2) C_(2n-1) = ...

A root-finding algorithm which converges to a complex root from any starting position. To motivate the formula, consider an nth order polynomial and its derivatives, P_n(x) = ...

The Laplace-Carson transform F of a real-valued function f is an integral transform defined by the formula F(p)=pint_0^inftye^(-pt)f(t)dt. (1) In most cases, the function F ...

A generalized hypergeometric function _pF_q(a_1,...,a_p;b_1,...,b_q;x) is a function which can be defined in the form of a hypergeometric series, i.e., a series for which the ...

The cylindrical parts of a system of real algebraic equations and inequalities in variables {x_1,...,x_n} are the terms f_1 <= x_1<=g_1 (1) f_2(x_1) <= x_2<=g_2(x_1) (2) | ...

A general quintic equation a_5x^5+a_4x^4+a_3x^3+a_2x^2+a_1x+a_0=0 (1) can be reduced to one of the form y^5+b_2y^2+b_1y+b_0=0, (2) called the principal quintic form. Vieta's ...

Zarankiewicz's conjecture asserts that graph crossing number for a complete bipartite graph K_(m,n) is Z(m,n)=|_n/2_||_(n-1)/2_||_m/2_||_(m-1)/2_|, (1) where |_x_| is the ...

The term "continued fraction" is used to refer to a class of expressions of which generalized continued fraction of the form b_0+(a_1)/(b_1+(a_2)/(b_2+(a_3)/(b_3+...))) ...