FAQ

Polynomial remainder theorem

Known as: Bezout's little theorem, Little Bezout Theorem, Little Bézout's theorem 
In algebra, the polynomial remainder theorem or little Bézout's theorem is an application of Euclidean division of polynomials. It states that the… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1967-2015
02419672015

Related topics

Related topics

5 relations
Factor theoremHorner's methodPolynomialPolynomial long division
(More)

Related mentions per year

Related mentions per year

1940-2018
19401960198020002020
Polynomial remainder theorem
Polynomial
Polynomial long division
Horner's method
Factor theorem
Synthetic division

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Error Correction in Polynomial Remainder Codes With Non-Pairwise Coprime Moduli and Robust Chinese Remainder Theorem for Polynomials
This paper investigates polynomial remainder codes with non-pairwise coprime moduli. We first consider a robust reconstruction… (More)
  • figure 1
  • figure 2
Is this relevant?
2012
2012
Improved polynomial remainder sequences for Ore polynomials☆
Polynomial remainder sequences contain the intermediate results of the Euclidean algorithm when applied to (non-)commutative… (More)
  • table 1
  • figure 1
  • figure 2
  • table 2
Is this relevant?
2011
2011
On irreducible polynomial remainder codes
A general class of polynomial remainder codes is considered. These codes are very flexible in rate and length and include Reed… (More)
Is this relevant?
2008
2008
Recursive Polynomial Remainder Sequence and its Subresultants
We introduce concepts of “recursive polynomial remainder sequence (PRS)” and “recursive subresultant,” along with investigation… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2005
2005
Recursive Polynomial Remainder Sequence and the Nested Subresultants
Abstract. We give two new expressions of subresultants, nested subresultant and reduced nested subresultant, for the recursive… (More)
Is this relevant?
2003
2003
Subresultants in Recursive Polynomial Remainder Sequence
We introduce concepts of “recursive polynomial remainder sequence (PRS)” and “recursive subresultant,” and investigate their… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1997
1997
Polynomial remainder sequence and approximate GCD
Let <i>P</i><inf>1</inf> and <i>P</i><inf>2</inf> be polynomials, univariate or multivariate, and let (<i>P</i><inf>1</inf>, <i>P… (More)
Is this relevant?
1995
1995
Primitive polynomial remainder sequences in elimination theory
Primitive polynomial remainder sequences (pprs) are more than a tool for computing gcd's; the content computations in the course… (More)
Is this relevant?
1995
1995
Matrix computation of subresultant polynomial remainder sequences in integral domains
We present an impr{wed variant of the matrix-triangularization subresultant prs method [1] fi~r the computation of a greatest… (More)
Is this relevant?
Highly Cited
1967
Highly Cited
1967
Subresultants and Reduced Polynomial Remainder Sequences
Let @@@@ be an integral domain, P(@@@@) the integral domain of polynomials over @@@@. Let <italic>P</italic>, <italic>Q</italic… (More)
  • table 1
Is this relevant?