Search Results for ""

There exists a total computable predicate P such that for any algorithm computing P(x) with running time T(x), there exists another algorithm computing P(x) with computation ...

A problem is assigned to the NP (nondeterministic polynomial time) class if it is solvable in polynomial time by a nondeterministic Turing machine. A P-problem (whose ...

The idea of a velocity vector comes from classical physics. By representing the position and motion of a single particle using vectors, the equations for motion are simpler ...

The jerk j is defined as the time derivative of the vector acceleration a, j=(da)/(dt).

The simplex method is a method for solving problems in linear programming. This method, invented by George Dantzig in 1947, tests adjacent vertices of the feasible set (which ...

The conditional intensity lambda(t) associated to a temporal point process N is defined to be the expected infinitesimal rate at which events are expected to occur around ...

The motion along a phase curve as a function of time (Tabor 1989, p. 14).

Solutions to holomorphic differential equations are themselves holomorphic functions of time, initial conditions, and parameters.

The sequency k of a Walsh function is defined as half the number of zero crossings in the time base.

The Yff central circle, a term coined here for the first time, is the circumcircle of the Yff central triangle.