- reduced polynomial
- мат. приведенный многочлен
Большой англо-русский и русско-английский словарь. 2001.
reduced polynomial
Смотреть что такое "reduced polynomial" в других словарях:
Polynomial factorization — In mathematics and computer algebra, polynomial factorization typically refers to factoring a polynomial into irreducible polynomials over a given field. Formulation of the questionOther factorizations, such as square free factorization exist,… … Wikipedia
Polynomial-time reduction — In computational complexity theory a polynomial time reduction is a reduction which is computable by a deterministic Turing machine in polynomial time. If it is a many one reduction, it is called a polynomial time many one reduction, polynomial… … Wikipedia
reduced — /ri doohst , dyoohst /, adj. 1. that is or has been reduced. 2. Math. noting a polynomial equation in which the second highest power is missing: The cubic equation x3 4x + 4 = 0 is reduced. [1620 30; REDUCE + ED2] * * * … Universalium
Schwartz-Zippel lemma and testing polynomial identities — Polynomial identity testing is the problem of determining whether a given multivariate polynomial is the0 polynomial or identically equal to 0. The input to the problem is an n variable polynomial over a fieldF. It can occur in the following… … Wikipedia
Irreducible polynomial — In mathematics, the adjective irreducible means that an object cannot be expressed as a product of at least two non trivial factors in a given set. See also factorization. For any field F , the ring of polynomials with coefficients in F is… … Wikipedia
Primitive polynomial — In field theory, a branch of mathematics, a primitive polynomial is the minimal polynomial of a primitive element of the finite extension field GF( p m ). In other words, a polynomial F(X) with coefficients in GF( p ) = Z/ p Z is a primitive… … Wikipedia
Macdonald polynomial — In mathematics, Macdonald polynomials P λ are a two parameter family of orthogonal polynomials indexed by a positive weight λ of a root system, introduced by Ian G. Macdonald (1987). They generalize several other families of orthogonal… … Wikipedia
Rook polynomial — Despite its name, the rook polynomial is used not only to solve chess recreational problems but also in a number of problems arising in combinatorial mathematics, group theory, and number theory.The coefficients of the rook polynomial represent… … Wikipedia
Yeoh (hyperelastic model) — The Yeoh hyperelastic material modelYeoh, O. H., 1993, Some forms of the strain energy function for rubber, Rubber Chemistry and technology, Volume 66, Issue 5, November 1993, Pages 754 771.] is a phenomenological model for the deformation of… … Wikipedia
mathematics — /math euh mat iks/, n. 1. (used with a sing. v.) the systematic treatment of magnitude, relationships between figures and forms, and relations between quantities expressed symbolically. 2. (used with a sing. or pl. v.) mathematical procedures,… … Universalium
Computational complexity theory — is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a… … Wikipedia
