Skip to search formSkip to main contentSkip to account menu

Factorization of polynomials

Known as: Factorisation of polynomials, How to factor polynomials, Kronecker's method 
In mathematics and computer algebra, factorization of polynomials or polynomial factorization is the process of expressing a polynomial with… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Polynomials with all the coefficients in $\{ 0,1\}$ and constant term 1 are called Newman polynomials, whereas polynomials with… 
2015
2015
We describe a subdivision algorithm for isolating the complex roots of a polynomial F ∈ C[x]. Our model assumes that each… 
2013
2013
In this paper we consider the hypersum polynomials, P (m) k (n) = P k+m+1 r=0 c r n r , and give an explicit formula for the… 
Review
2009
Review
2009
In this short communication we want to give an overview of how OpenMath is used in the European project "SCIEnce" [12]. The main… 
2000
2000
We propose a method for a minimum phase finite impulse response (FIR) equiripple filter design from a given linear phase FIR… 
1996
1996
Lie Algebraic methodsl implemented with truncated power series algebra packages2 or libraries,3 have become important in… 
1995
1995
A conformai mapping of the exterior of the unit circle to the exterior of a region of the complex plane determines the Faber… 
1981
1981
This paper deals with the two following topics: bounds for the heights of divisors of polynomials, minimal distance between… 
1964
1964
Introduction. A Banach algebra in this paper will be understood to mean a commutative, semi-simple Banach algebra with…