- reducible polynomial
- мат. приводимый многочлен
Большой англо-русский и русско-английский словарь. 2001.
reducible polynomial
Смотреть что такое "reducible polynomial" в других словарях:
reducible polynomial — noun : a polynomial expressible as the product of two or more polynomials of lower degree … Useful english dictionary
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
reducible — reducibility, reducibleness, n. reducibly, adv. /ri dooh seuh beuhl, dyooh /, adj. 1. capable of being reduced. 2. Math. a. of or pertaining to a polynomial that can be factored into the product of polynomials, each of lower degree. b. of or… … Universalium
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
Gauss's lemma (polynomial) — This article is about Gauss s lemma for polynomials. See also Gauss s lemma. In algebra, in the theory of polynomials, Gauss s lemma, named after Carl Friedrich Gauss, is either of two related statements about polynomials with integral… … Wikipedia
приведенный полином — приводимый полином — [Л.Г.Суменко. Англо русский словарь по информационным технологиям. М.: ГП ЦНИИС, 2003.] Тематики информационные технологии в целом Синонимы приводимый полином EN reducible polynomial … Справочник технического переводчика
приводимый полином — — [http://www.iks media.ru/glossary/index.html?glossid=2400324] Тематики электросвязь, основные понятия EN reducible polynomial … Справочник технического переводчика
Reduction (recursion theory) — In computability theory, many reducibility relations (also called reductions, reducibilities, and notions of reducibility) are studied. They are motivated by the question: given sets A and B of natural numbers, is it possible to effectively… … Wikipedia
Random self-reducibility — (RSR): A good algorithm for the average case implies a good algorithm for the worst case. RSR is the ability to solve all instances of a problem by solving a large fraction of the instances.DefinitionIf a function f evaluating any instance x can… … Wikipedia
Perron–Frobenius theorem — In linear algebra, the Perron–Frobenius theorem, proved by Oskar Perron (1907) and Georg Frobenius (1912), asserts that a real square matrix with positive entries has a unique largest real eigenvalue and that the corresponding… … Wikipedia
NP-complete — Euler diagram for P, NP, NP complete, and NP hard set of problems In computational complexity theory, the complexity class NP complete (abbreviated NP C or NPC) is a class of decision problems. A decision problem L is NP complete if it is in the… … Wikipedia
