Search Results for ""

A coloring of plane regions, link segments, etc., is an assignment of a distinct labeling (which could be a number, letter, color, etc.) to each component. Coloring problems ...

The complete products of a Boolean algebra of subsets generated by a set {A_k}_(k=1)^p of cardinal number p are the 2^p Boolean functions B_1B_2...B_p=B_1 intersection B_2 ...

A computation is an operation that begins with some initial conditions and gives an output which follows from a definite set of rules. The most common example are ...

Computation time (also called "running time") is the length of time required to perform a computational process. Representation a computation as a sequence of rule ...

A concordant form is an integer triple (a,b,N) where {a^2+b^2=c^2; a^2+Nb^2=d^2, (1) with c and d integers. Examples include {14663^2+111384^2=112345^2; ...

Four or more points P_1, P_2, P_3, P_4, ... which lie on a circle C are said to be concyclic. Three points are trivially concyclic since three noncollinear points determine a ...

Conformal latitude is defined by chi = 2tan^(-1){tan(1/4pi+1/2phi)[(1-esinphi)/(1+esinphi)]^(e/2)}-1/2pi (1) = ...

A product of ANDs, denoted ^ _(k=1)^nA_k. The conjunctions of a Boolean algebra A of subsets of cardinality p are the 2^p functions A_lambda= union _(i in lambda)A_i, where ...

A graph is called cordial if it is possible to label its vertices with 0s and 1s so that when the edges are labeled with the difference of the labels at their endpoints, the ...

The Cunningham function, sometimes also called the Pearson-Cunningham function, can be expressed using Whittaker functions (Whittaker and Watson 1990, p. 353). ...