Search Results for ""

In the archaic terminology of Whittaker and Watson (1990), the complex number z representing x+iy.

The number of single operations (of addition, subtraction, and multiplication) required to complete an algorithm.

Maximize the number of cookies you can cut from a given expanse of dough (Hoffman 1998, p. 173).

The Hamming distance between two vertices of a hypercube is the number of coordinates at which the two vertices differ.

The number of outward directed graph edges from a given graph vertex in a directed graph.

The polynomial giving the number of colorings with m colors of a structure defined by a permutation group.

The cumulative frequency in a frequency distribution divided by the total number of data points.

The sequency k of a Walsh function is defined as half the number of zero crossings in the time base.

A tree having an infinite number of branches and whose nodes are sequences generated by a set of rules.

A matrix is ill-conditioned if the condition number is too large (and singular if it is infinite).