TOPICS
Search

Search Results for ""


10011 - 10020 of 13135 for OTHER ANALYSISSearch Results
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 ...
Let V be a real vector space (e.g., the real continuous functions C(I) on a closed interval I, two-dimensional Euclidean space R^2, the twice differentiable real functions ...
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 ...
A subset of an algebraic variety which is itself a variety. Every variety is a subvariety of itself; other subvarieties are called proper subvarieties. A sphere of the ...
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) ...
The Suetake graph is a weakly regular Hamiltonian graph on 231 vertices with parameters (nu,k,lambda,mu)=(72,(12),(0),(0,4)). It is distance-regular with intersection array ...
If P(n) is a sentential formula depending on a variable n ranging in a set of real numbers, the sentence P(n) for every sufficiently large n (1) means exists N such that P(n) ...

...