Search Results for ""

A problem is assigned to the P (polynomial time) class if there exists at least one algorithm to solve that problem, such that the number of steps of the algorithm is bounded ...

A partial algebra is a pair A=(A,(f_i^A)_(i in I)), where for each i in I, there are an ordinal number alpha_i and a set X_i subset= A^(alpha_i) such that f_i^A is a function ...

The angular position of a quantity. For example, the phase of a function cos(omegat+phi_0) as a function of time is phi(t)=omegat+phi_0. The complex argument of a complex ...

A prismatoid having planar sides and the same number of vertices in both of its parallel planes. The faces of a prismoid are therefore either trapezoids or parallelograms. ...

The whole neighborhood of any point y_i of an algebraic curve may be uniformly represented by a certain finite number of convergent developments in power series, ...

A random composition of a number n in k parts is one of the (n+k-1; n) possible compositions of n, where (n; k) is a binomial coefficient. A random composition can be given ...

A curvilinear polygon built up of circular arcs. The Reuleaux polygon is a generalization of the Reuleaux triangle and, for an odd number of sides, is a curve of constant ...

Let a sequence {a_i}_(i=1)^infty be strictly increasing and composed of nonnegative integers. Call A(x) the number of terms not exceeding x. Then the density is given by ...

Let v(G) be the number of vertices in a graph G and h(G) the length of the maximum cycle in G. Then the shortness exponent of a class of graphs G is defined by sigma(G)=lim ...

A set of circuits going along the graph edges of a graph, each with an even number of graph edges, such that just one of the circuits passes through each graph vertex (Ball ...