Search Results for ""

The maximum flow between vertices v_i and v_j in a graph G is exactly the weight of the smallest set of edges to disconnect G with v_i and v_j in different components (Ford ...

Find two numbers such that x^2=y^2 (mod n). If you know the greatest common divisor of n and x-y, there exists a high probability of determining a prime factor. Taking small ...

A set P is called perfect if P=P^', where P^' is the derived set of P.

A definable set which is the complement of an analytic set.

A set whose members index (label) members of another set. For example, in the set A= union _(k in K)A_k, the set K is an index set of the set A.

A definable set, also called a Souslin set.

A hom-set of a category C is a set of morphisms of C.

The limit points of a set P, denoted P^'.

An analytic, Borel, or coanalytic set.

A connected set is a set that cannot be partitioned into two nonempty subsets which are open in the relative topology induced on the set. Equivalently, it is a set which ...