Search Results for ""

An expression built up from statements letters by appropriate application of connectives (Mendelson 1997, p. 13).

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 1-form w is said to be exact in a region R if there is a function f that is defined and of class C^1 (i.e., is once continuously differentiable in R) and such that df=w.

Consider the forms Q for which the generic characters chi_i(Q) are equal to some preassigned array of signs e_i=1 or -1, e_1,e_2,...,e_r, subject to product_(i=1)^(r)e_i=1. ...

There are three types of so-called fundamental forms. The most important are the first and second (since the third can be expressed in terms of these). The fundamental forms ...

Let X_1,X_2,...,X_N be a set of N independent random variates and each X_i have an arbitrary probability distribution P(x_1,...,x_N) with mean mu_i and a finite variance ...

erf(z) is the "error function" encountered in integrating the normal distribution (which is a normalized form of the Gaussian function). It is an entire function defined by ...

The modular equation of degree five can be written (u/v)^3+(v/u)^3=2(u^2v^2-1/(u^2v^2)).

Let A be a sum of squares of n independent normal standardized variates X_i, and suppose A=B+C where B is a quadratic form in the x_i, distributed as chi-squared with h ...

V_t=e^(-ytau)S_tN(d_1)-e^(-rtau)KN(d_2), where N is the cumulative normal distribution and d_1,d_2=(log((S_t)/K)+(r-y+/-1/2sigma^2)tau)/(sigmasqrt(tau)). If y=0, this is the ...