Search Results for ""

There exists a total computable predicate P such that for any algorithm computing P(x) with running time T(x), there exists another algorithm computing P(x) with computation ...

Let T be a tree defined on a metric over a set of paths such that the distance between paths p and q is 1/n, where n is the number of nodes shared by p and q. Let A be a ...

The boustrophedon ("ox-plowing") transform b of a sequence a is given by b_n = sum_(k=0)^(n)(n; k)a_kE_(n-k) (1) a_n = sum_(k=0)^(n)(-1)^(n-k)(n; k)b_kE_(n-k) (2) for n>=0, ...

The statistical index P_B=1/2(P_L+P_P), where P_L is Laspeyres' index and P_P is Paasche's index.

The Bowley skewness, also known as quartile skewness coefficient, is defied by ((Q_3-Q_2)-(Q_2-Q_1))/(Q_3-Q_1)=(Q_1-2Q_2+Q_3)/(Q_3-Q_1), where the Qs denote the interquartile ...

The Bron-Kerbosch algorithm is an efficient method for finding all maximal cliques in a graph.

For every positive integer n, there exists a square in the plane with exactly n lattice points in its interior. This was extended by Schinzel and Kulikowski to all plane ...

The 6-polyiamond illustrated above.

The central factorials x^([k]) form an associated Sheffer sequence with f(t) = e^(t/2)-e^(-t/2) (1) = 2sinh(1/2t), (2) giving the generating function ...

A point v is a central point of a graph if the eccentricity of the point equals the graph radius. The set of all central points is called the graph center.