「Polynomials」の共起表現一覧(1語右で並び替え)
該当件数 : 56件
| e can ask for the invariants of homogeneous | polynomials A0xry0 + ... + Arx0yr of higher degree, whi |
| Characteristic | polynomials also have eigenvalues as roots. |
| for his work on von Neumann algebras, knot | polynomials and conformal field theory. |
| Sparse | Polynomials and Linear Logic |
| Finding roots of | polynomials and functions |
| His main activity is related to | polynomials and their approximations. |
| Bari's dissertation explored chromatic | polynomials and the Birkhoff-Lewis conjecture. |
| This is the product of Frobenius | polynomials, and thus generalizes to arbitrary fields. |
| The Methods Book also contains | polynomials and tables (derived from the polynomials) w |
| hile working on his thesis, Non-commutative | polynomials and cyclic algebras, he was advised by Jose |
| So the first few cyclotomic | polynomials are |
| The Fibonacci | polynomials are another generalization of Fibonacci num |
| Polynomials are implemented recursively as general link | |
| chromatic polynomial, and determining which | polynomials are chromatic. |
| e correction factors, also derived from the | polynomials, are the basis for the Automatic Temperatur |
| These | polynomials are all of degree n-1 and are supposed to c |
| argument for completeness of the Zhegalkin | polynomials as a boolean basis. |
| The central idea is to take | polynomials at random and test them for irreducibility. |
| sieve application, it is necessary for two | polynomials both to have smooth values; this is handled |
| This method to find the zeroes of | polynomials can thus be easily implemented with a progr |
| Two | polynomials f(x) and g(x) of small degrees d and e are |
| on | polynomials f, is the same as |
| e invariants of the Coxeter group acting on | polynomials form a polynomial algebra whose generators |
| geometric numerical integration, orthogonal | polynomials, functional equations, computational dynami |
| w geometric properties of zeros of integral | polynomials in many variables can be determined by the |
| pical to have Euler products with quadratic | polynomials in the denominator here. |
| An explicit formula for the Euler | polynomials is given by |
| To that end, a sequence of so called H | polynomials is constructed. |
| ithmetic, finite fields, vectors, matrices, | polynomials, lattice basis reduction and basic linear a |
| The | polynomials occurring in the numerator and denominator |
| where P(x), S(x), Y(x) are known | polynomials of degrees p, s and y, R(x) known polynomia |
| Many real | polynomials of even degree do not have a real root, but |
| Let f1,...,fm be | polynomials of degree at most d≥3 in n≥2 variables. |
| The table below lists only the | polynomials of the various algorithms in use. |
| where Pn(x) and Qn(x) are | polynomials of degree ≤ 2n, and with integer coefficien |
| e relation between the elementary symmetric | polynomials of a tuple of complex numbers and its sums |
| comparable explanation of the connection of | polynomials of degree m, and the representation theory |
| his expression involves the squaring of two | polynomials of only half the degree, and is therefore u |
| connectedness locus in a parameter space of | polynomials or rational functions consists of those par |
| tional logic, and sometimes as multivariate | polynomials over GF(2), but more efficient representati |
| based on interpolation and factorization of | polynomials over GF(2m) and its extensions. |
| Fourier transform for the evaluation of the | polynomials p(x) and p'(x). |
| The total degrees of the | polynomials Q1(X)E1(X) and . |
| es can be computed by taking the product as | polynomials, then reducing any powers of r ≥ n as descr |
| As is the case for the Chebyshev | polynomials, this may be expressed in explicitly comple |
| h simpler arithmetic character of Zhegalkin | polynomials was first noticed in the west (independentl |
| ifferent formula for Mn involving Chebyshev | polynomials was given by . |
| A new language for Taylor | polynomials was introduced from the 1930s, as the theor |
| , such as the full parameter space of cubic | polynomials, where there is more than one free critical |
| em of numerical coefficients (for Chebyshev | polynomials) which can be used to recover (calculate) t |
| above in terms of the elementary symmetric | polynomials with respect to the measure dνn(x) is expre |
| The non-real roots of | polynomials with real coefficients come in conjugate pa |
こんにちは ゲスト さん
|
ログイン |
Weblio会員(無料)になると
|
こんにちは ゲスト さん
|
ログイン |
Weblio会員(無料)になると
|