TOPICS
Search

Search Results for ""


251 - 260 of 1587 for P versus NP problemSearch Results
The absolute moment of M_n of a probability function P(x) taken about a point a is defined by M_n=int|x-a|^nP(x)dx.
A binary relation associated with an instance of the stable marriage problem. Stable marriages correspond to vertices with outdegree 0 in the divorce digraph (Skiena 1990, p. ...
Let S_n be the sum of n random variates X_i with a Bernoulli distribution with P(X_i=1)=p_i. Then sum_(k=0)^infty|P(S_n=k)-(e^(-lambda)lambda^k)/(k!)|<2sum_(i=1)^np_i^2, ...
The geometry resulting from the application of the inversion operation. It can be especially powerful for solving apparently difficult problems such as Steiner's porism and ...
It is possible to perform multiplication of large numbers in (many) fewer operations than the usual brute-force technique of "long multiplication." As discovered by Karatsuba ...
The problem of maximizing a linear function over a convex polyhedron, also known as operations research or optimization theory. The general problem of convex optimization is ...
Cauchy conditions are initial conditions (time conditions) rather than boundary conditions (space conditions). An initial-value problem is often termed a Cauchy problem. ...
A method which can be used to solve the initial value problem for certain classes of nonlinear partial differential equations. The method reduces the initial value problem to ...
The so-called reaching algorithm can solve the shortest path problem (i.e., the problem of finding the graph geodesic between two given nodes) on an m-edge graph in O(m) ...
In a given triangle DeltaABC with all angles less than 120 degrees (2pi/3, the first Fermat point X or F_1 (sometimes simply called "the Fermat point," Torricelli point, or ...
1 ... 23|24|25|26|27|28|29 ... 159 Previous Next

...