「Polynomial」の共起表現(1語右で並び替え)

Weblio 辞書 > 英和辞典・和英辞典 > Polynomialの意味・解説 > Polynomialに関連した共起表現

意味

例文

類語

共起表現

「Polynomial」の共起表現一覧(1語右で並び替え)

該当件数 : 180件

e Coxeter group acting on polynomials form a	polynomial algebra whose generators are the fundamental
stract algebra, for instance group algebras,	polynomial algebras and matrix algebras, are unital, if
For the circulation problem, many	polynomial algorithms have been developed (e.g., Edmond
means that the solution takes the form of a	Polynomial, and this polynomial satisfies the DAE and t
manipulation capability, e.g., multivariate	polynomial and rational function handling.
tisfied by sums of terms of a hypergeometric	polynomial and requires only the series expansions of t
esentation of the original type looks like a	polynomial, and the representation of the type of conte
erizing graphs which have the same chromatic	polynomial, and determining which polynomials are chrom
ere proposed in the 19th century to tabulate	polynomial approximations of logarithmic functions - i.
The coefficients of the characteristic	polynomial are all polynomial expressions in the entrie
if all the eigenvalues of its characteristic	polynomial are integers.
can rewrite the formula for a trigonometric	polynomial as
Notice that this function is not	polynomial, as it might branch in almost every step if
algorithm improved on Khachiyan's worst-case	polynomial bound (giving O(n3.5L)).
The coefficients of the iterated	polynomial can then be approximated by their leading te
A high-degree	polynomial can be wiggly, so it can fit a given set of
This is popularly known as the generalized	polynomial chaos (gPC) framework.
For large numbers of random variables,	polynomial chaos becomes very computationally expensive
This convention encodes the	polynomial complete with its degree in one integer.
t Singular) is a computer algebra system for	polynomial computations with special emphasis on the ne
linear approximations are an alternative to	polynomial corrections.
spacetimes are Lorentzian manifolds with all	polynomial curvature invariants of all orders vanishing
s is equal to the number of monomials in the	polynomial det(A), and is also equal to the permanent o
admits a perfect matching if and only if the	polynomial det(Aij) in the xij is not identically zero.
igmoidal, Hyperbolic, Yield Density, Linear,	Polynomial, Dose Response, Pharmacology, Equilibrium, I
ments in numerical linear algebra, including	polynomial eigenvalue and structured matrix problems.
The three graphs with a chromatic	polynomial equal to (x − 2)(x − 1)3x.
can be obtained because it is a fourth order	polynomial equation in f, due to complexity of the solu
ed of resultant calculations with systems of	polynomial equations that exhibit symmetry.
decomposition of F (regarded as a system of	polynomial equations) over the algebraic closure of .
fractions of the coordinate ring of V. Using	polynomial equations, it is easy to define sets that ha
assignment problem within time bounded by a	polynomial expression of the number of agents.
que for finding smooth values of a bivariate	polynomial f(a,b) over a large region.
The	polynomial f(x) that results will only be an approximat
le to solve problems such as simplification,	polynomial factorization, indefinite integration, solut
mplification, substitution, differentiation,	polynomial factorization, indefinite integration, direc
or sufficiently large n, it coincides with a	polynomial function of degree equal to dim(grI(M)) − 1.
of length n in the language is bounded by a	polynomial function of n.
other words, for a fixed contraction T, the	polynomial functional calculus map is itself a contract
ples of unimodal functions include Quadratic	polynomial functions with a negative quadratic coeffici
trast to the situation with real zeros: some	polynomial functions with real coefficients have no rea
multiple allocation by linear interpolation	polynomial functions.
Such a	polynomial has a high capacity.
See the	polynomial hierarchy article.
tically to belong to the second level of the	polynomial hierarchy.
arger than the number of coefficients in the	polynomial, i.e., N ≤ 2n+1 (a solution may or may not e
, consider the thresholding of a high-degree	polynomial: if the polynomial evaluates above zero, tha
The algorithm takes time bounded by a	polynomial in n, the dimension of K and 1 / ε.
This algorithm is	polynomial in the values of N and P, which are exponent
fields, the user finds an irreducible monic	polynomial in a symbolic variable, say p(t1), and comma
a method can always produce a proof of size	polynomial in the size of the formula.
e of the generated theory are required to be	polynomial in the size of the original theory.
em is NP-complete, since W, unlike n, is not	polynomial in the length of the input to the problem.
chings of a graph on n vertices bounded by a	polynomial in n? (cf.)
lumes of regions of Euclidean space given by	polynomial inequalities with rational coefficients.
a set of nodes) measure the precision of the	polynomial interpolation at those nodes in regard with
Donaldson also derived	polynomial invariants from gauge theory.
ults was a structure theorem for Donaldson's	polynomial invariants and applications to minimal genus
of the fundamental invariants of the ring of	polynomial invariants.
Its Tutte	polynomial is x4 + x3 + x2y.
The first type of matching	polynomial is a direct generalization of the rook polyn
Then the Tutte	polynomial is defined by the recurrence relation
A Zhegalkin	polynomial is the sum (exclusive-or) of a set of Zhegal
For the Petersen graph, this	polynomial is t(t − 1)(t − 2)(t7 − 12t6 + 67t5 − 230t4
le cubic x3 + x2 - 2x - 1. Consequently this	polynomial is the minimal polynomial of 2cos(2π/7), whe
r of the ladder graph is 2 and its chromatic	polynomial is (x − 1)x(x2 − 3x + 3)(n − 1).
Once each order of the	polynomial is decoded, the received word is modified ac
on outside the sugar industry as the sucrose	polynomial is built into the firmware of modern refract
h phrases as cyclotomic field and cyclotomic	polynomial; it is from the Greek roots "cyclo" (circle)
freedom in a given model, the shape function	polynomial level is increased rather than remeshing wit
also the only graph with this characteristic	polynomial, making it a graph determined by its spectru
This	polynomial may not fit the training set well, because i
An easy way to estimate a first-degree	polynomial model is to use a factorial experiment or a
n be implemented to estimate a second-degree	polynomial model, which is still only an approximation
of the division (modulo 2) by the generator	polynomial multiplied by the content of the header excl
t guaranteed to converge to some root of the	polynomial no matter where the initial approximation is
SAT can be solved by Boolean circuits with a	polynomial number of logic gates, then the polynomial h
possibility of a larger but still linear or	polynomial number of steps.
One matching	polynomial of G is
The characteristic	polynomial of the F26A graph is equal to
The characteristic	polynomial of the Gosset graph is
The characteristic	polynomial of the Hoffman graph is equal to
The characteristic	polynomial of the Gewirtz graph is
The characteristic	polynomial of the Harries graph is
The characteristic	polynomial of the Franklin graph is
The characteristic	polynomial of the Harries-Wong graph is
The characteristic	polynomial of the Ljubljana graph is
The chromatic	polynomial of the bull graph is (x − 2)(x − 1)3x.
t theory for an example computing the Conway	polynomial of the trefoil.
The chromatic	polynomial of a graph, for example, counts the number o
Every real	polynomial of odd degree has at least one real number a
The characteristic	polynomial of a null electrovacuum vanishes identically
Let P be a	polynomial of degree n on complex numbers with derivati
t should be noted that this is not the Tutte	polynomial of G.)
s an ample line bundle on X, and the Ehrhart	polynomial of P coincides with the Hilbert polynomial o
Correspondingly, the Eulerian	polynomial of second kind, here denoted Pn (no standard
The characteristic	polynomial of the Higman-Sims graph is (x − 22)(x − 2)7
The characteristic	polynomial of the Hall-Janko graph is (x − 36)(x − 6)36
In coding theory, the weight enumerator	polynomial of a binary linear code specifies the number
The characteristic	polynomial of the Meredith graph is (x − 4)(x − 1)10x21
The characteristic	polynomial of the McGeeGraph graph is : x3(x − 3)(x − 2
The chromatic	polynomial of the Brinkmann graph is x21 - 42x20 + 861x
amental theorem of algebra states that every	polynomial of degree n has n complex roots, counted wit
The characteristic	polynomial of the Foster graph is equal to (x − 3)(x −
olynomials of degrees p, s and y, R(x) known	polynomial of degree not greater than p − 1, T(x) and X
The graph of the cubic	polynomial on the real line
In this case μG(1,x) is a Fibonacci	polynomial or Lucas polynomial respectively.
This may be a simple quadratic, or a	polynomial or rational function over a Galois field.
is the splitting field of the nth cyclotomic	polynomial over Q.
ension of finite field is via an irreducible	polynomial over the ground field with degree equal to t
That is that for any	polynomial P and contraction T on Lp
Starting with the current	polynomial P(X) of degree n, the smallest root of P(x)
ontraction T acting on a Hilbert space and a	polynomial p, then the norm of p(T) is bounded by the s
The	polynomial pA(t) is monic (its leading coefficient is 1
ky-Golay method essentially performs a local	polynomial regression (of degree k) on a series of valu
al functions F and G on it must satisfy some	polynomial relation
The most popular surrogate models are	polynomial response surfaces, Kriging, support vector m
ple, the invariants of group number 4 form a	polynomial ring with 2 generators of degrees 4 and 6.
d form a regular sequence of length d on the	polynomial ring k[X1, X2, ..., Xd] and there are no lon
. Seshadri's work on projective modules over	polynomial rings and M. S. Narasimhan's results in the
dabra has extensive functionality for tensor	polynomial simplification including multi-term symmetri
family F of graphs has a universal graph of	polynomial size, containing every n-vertex graph as an
h on circuits with polylogarithmic depth and	polynomial size.
probabilistic Turing machines with at most a	polynomial slowdown?
ants of graphs, and especially the chromatic	polynomial, the Tutte polynomial and knot invariants.
he triangle are the complex zeros of a cubic	polynomial, then the foci of the Steiner inellipse are
M. Koebe announced a	polynomial time recognition algorithm, but it was never
imensionality theory has been used to obtain	Polynomial Time Approximation Schemes (PTAS) for many b
Thus, the problem may be solved in	polynomial time whenever k is a fixed constant.
approximation algorithms that run in	polynomial time and find a solution that is "close" to
There exist fully	polynomial time approximation schemes for solving the p
It can be solved in	polynomial time for split graph and threshold graph.
This solution does not count as	polynomial time in complexity theory because P − N is n
ber of NP-hard problems with floorplans have	polynomial time algorithms when restricted to sliceable
vertices into k sets, it can be verified in	polynomial time that each set forms a clique, so the pr
An alternating Turing machine in	polynomial time with k alternations, starting in an exi
scenario is also achievable, and proposed a	polynomial time algorithm.
work as a complete top-down parsing tool in	polynomial time and space.
g before its proof for general graphs, and a	polynomial time recognition algorithm for Bull-free per
ing Markov chains, they show that it takes a	polynomial time for the random walk to settle down to b
s, is there a problem which can be solved in	polynomial time by a probabilistic Turing machine but n
strict still life or a pseudo still life in	polynomial time by searching for cycles in an associate
) into a related problem that is solvable in	polynomial time (linear programming); the solution to t
problem in this area whether there exists a	polynomial time algorithm that can take as input a grap
Since h is computable in	polynomial time, we have thus shown L ∈ Σp2.
rcuits in directed graphs can be computed in	polynomial time, a problem which is #P-complete for und
the machine to logarithmic space instead of	polynomial time, we obtain the analogous RL, Co-RL, BPL
Since maximum matchings may be found in	polynomial time, so may the maximum independent sets of
This can be checked in	polynomial time.
ess planar graphs the MWCCP can be solved in	polynomial time.
riant of the problem, a solution is found in	polynomial time.
gorithm was proposed to find such paths in a	polynomial time.
dle certain more specialized input graphs in	polynomial time.
of maximal cliques, which may be computed in	polynomial time.
the maximum independent set may be found in	polynomial time.
P-complete problem) can in fact be solved in	polynomial time.
lved by a nondeterministic Turing machine in	polynomial time.
minimizing the total number of crossings, in	polynomial time.
d to within any approximation ratio c < 1 in	polynomial time; similar polynomial-time approximation
within the disk of radius 1, the degree of a	polynomial times the maximum value of a polynomial is a
ieta's formulas relate the coefficients of a	polynomial to sums and products of its roots.
A	polynomial trend line demonstrates the quadratic growth
nd to the coefficients of the characteristic	polynomial, up to a scalar factor that depends only on
He is the namesake of the Purdy	polynomial used in operating systems (e.g., OpenVMS) to
most important fact about the characteristic	polynomial was already mentioned in the motivational pa
The quadratic evenly divides the	polynomial when
eir invariants, especially the colored Tutte	polynomial, which generalizes the Tutte polynomial of a
eorem of algebra says that every nonconstant	polynomial with complex coefficients has at least one z
the Newton-Raphson method applied to a cubic	polynomial with distinct roots, such as x3 − 1; see the
ormula for the primes: that is, multivariate	polynomial with the property that the positive values o
RC), where the 1-bit CRC is generated by the	polynomial x+1.
reshold or median operation as the Zhegalkin	polynomial xy⊕yz⊕zx, which is 1 when at least two of th

共起表現

「Polynomial」の共起表現(1語右で並び替え) - Weblio英語共起表現検索

「Polynomial」の共起表現一覧(1語右で並び替え)