Search Results for ""
5751 - 5760 of 13134 for complexity theorySearch Results
Let X be a set. Then a sigma-algebra F is a nonempty collection of subsets of X such that the following hold: 1. X is in F. 2. If A is in F, then so is the complement of A. ...
Given a Hilbert space H, the sigma-strong operator topology is the topology on the algebra L(H) of bounded operators from H to itself defined as follows: A sequence S_i of ...
Two figures are said to be similar when all corresponding angles are equal and all distances are increased (or decreased) in the same ratio, called the ratio of magnification ...
A simple graph, also called a strict graph (Tutte 1998, p. 2), is an unweighted, undirected graph containing no graph loops or multiple edges (Gibbons 1985, p. 2; West 2000, ...
A simple point process (or SPP) is an almost surely increasing sequence of strictly positive, possibly infinite random variables which are strictly increasing as long as they ...
Simpson's paradox, also known as the amalgamation paradox, reversal paradox, or Yule-Simpson effect, is a paradox in which a statistical trend appears to be present when data ...
For d>=1, Omega an open subset of R^d, p in [1;+infty] and s in N, the Sobolev space W^(s,p)(R^d) is defined by W^(s,p)(Omega)={f in L^p(Omega): forall ...
Sorting is the rearrangement of numbers (or other orderable objects) in a list into their correct lexographic order. Alphabetization is therefore a form of sorting. Because ...
Gardner showed how to dissect a square into eight and nine acute scalene triangles. W. Gosper discovered a dissection of a unit square into 10 acute isosceles triangles, ...
Given a set of n men and n women, marry them off in pairs after each man has ranked the women in order of preference from 1 to n, {w_1,...,w_n} and each women has done ...
...
View search results from all Wolfram sites (28442 matches)

