Search Results for ""

A graph is strongly perfect if every induced subgraph H has an independent vertex set meeting all maximal cliques of H (Berge and Duchet 1984, Ravindra 1999). Every strongly ...

Let L be a language of the first-order logic. Assume that the language L has the following sets of nonlogical symbols: 1. C is the set of constant symbols of L. (These are ...

The probability density function for Student's z-distribution is given by f_n(z)=(Gamma(n/2))/(sqrt(pi)Gamma((n-1)/2))(1+z^2)^(-n/2). (1) Now define ...

A collection of subsets of a topological space that is contained in a basis of the topology and can be completed to a basis when adding all finite intersections of the ...

A subgraph G^' of a graph G is a graph G^' whose vertex set and edge set are subsets of those of G. If G^' is a subgraph of G, then G is said to be a supergraph of G^' ...

For a particular format in the IEEE 754-2008 framework, a subnormal number is a nonzero floating-point number with magnitude less than the magnitude of that formatÕs smallest ...

The multiplicative suborder of a number a (mod n) is the least exponent e>0 such that a^e=+/-1 (mod n), or zero if no such e exists. An e always exists if GCD(a,n)=1 and n>1. ...

Subresultants can be viewed as a generalization of resultants, which are the product of the pairwise differences of the roots of polynomials. Subresultants are the most ...

A map which uses a set of rules to transform elements of a sequence into a new sequence using a set of rules which "translate" from the original sequence to its ...

The successive square method is an algorithm to compute a^b in a finite field GF(p). The first step is to decompose b in successive powers of two, b=sum_(i)delta_i2^i, (1) ...