Search Results for ""

Multiple edges are two or more edges connecting the same two vertices within a multigraph. Multiple edges of degree d_(ij) between vertex i and vertex j correspond to an ...

A New Kind of Science is a seminal work on simple programs by Stephen Wolfram. In 1980, Wolfram's studies found unexpected behavior in a collection of simple computer ...

The Paris-Harrington theorem is a strengthening of the finite Ramsey's theorem by requiring that the homogeneous set be large enough so that cardH>=minH. Clearly, the ...

Partial evaluation is a branch of computer science studying program transformation via specialization. Any function can be specialized by fixing one or more of its inputs to ...

The (26,8)-Paulus graph having the largest possible graph automorphism group order of all 26-node Paulus graphs (namely 120) is sometimes known as the ...

A set T of integers is said to be recursively enumerable if it constitutes the range of a recursive function, i.e., if there exists a recursive function that can eventually ...

Determination of whether predicate P(x_1,...,x_n) is true or false for any given values of x_1, ..., x_n is called its decision problem. The decision problem for predicate ...

A set A of integers is said to be one-one reducible to a set B (A<<_1B) if there is a one-one recursive function f such that for every x, x in A=>f(x) in B (1) and f(x) in ...

In his famous paper of 1859, Riemann stated that the number N(T) of Riemann zeta function zeros sigma+it with 0<t<=T is asymptotically given by ...

A rolling polyhedron graph is a graph obtained by rolling a polyhedral solid along a board whose tiles match up with the faces of the polyhedron being rolled. The vertices of ...