Search Results for ""

An algorithm is said to be solvable in polynomial time if the number of steps required to complete the algorithm for a given input is O(n^k) for some nonnegative integer k, ...

A property that is always fulfilled by the product of topological spaces, if it is fulfilled by each single factor. Examples of productive properties are connectedness, and ...

The projective plane crossing number of a graph is the minimal number of crossings with which the graph can be drawn on the real projective plane. A graph with projective ...

A proof by contradiction establishes the truth of a given proposition by the supposition that it is false and the subsequent drawing of a conclusion that is contradictory to ...

A graph G that becomes disconnected when removing a suitable complete subgraph K, called a vertex cut, is said to be quasiseparable. The two simplest cases are those where K ...

If the rank polynomial R(x,y) of a graph G is given by sumrho_(rs)x^ry^s, then rho_(rs) is the number of subgraphs of G with rank r and co-rank s, and the matrix (rho_(rs)) ...

According to most authors (e.g., Kelley 1955, p. 113; McCarty 1967, p. 144; Willard 1970, p. 92) a regular space is a topological space in which every neighborhood of a point ...

The regularized beta function is defined by I(z;a,b)=(B(z;a,b))/(B(a,b)), where B(z;a,b) is the incomplete beta function and B(a,b) is the (complete) beta function. The ...

The regularized gamma functions are defined by P(a,z) = (gamma(a,z))/(Gamma(a)) (1) Q(a,z) = (Gamma(a,z))/(Gamma(a)), (2) where gamma(a,z) and Gamma(a,z) are incomplete gamma ...

The word residue is used in a number of different contexts in mathematics. Two of the most common uses are the complex residue of a pole, and the remainder of a congruence. ...