Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,357,975 papers from all fields of science
Search
Sign In
Create Free Account
Factorization of polynomials
Known as:
Factorisation of polynomials
, How to factor polynomials
, Kronecker's method
Expand
In mathematics and computer algebra, factorization of polynomials or polynomial factorization is the process of expressing a polynomial with…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
20 relations
Arjen Lenstra
Computer algebra system
Cubic function
Factorization of polynomials over finite fields
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
On certain multiples of Littlewood and Newman polynomials
Paulius Drungilas
,
Jonas Jankauskas
,
Grintas Junevičius
,
Lukas Klebonas
,
Jonas Siurys
2018
Corpus ID: 55097467
Polynomials with all the coefficients in $\{ 0,1\}$ and constant term 1 are called Newman polynomials, whereas polynomials with…
Expand
2015
2015
A Simple Near-Optimal Subdivision Algorithm for Complex Root Isolation based on the Pellet Test and Newton Iteration
R. Becker
,
Michael Sagraloff
,
Vikram Sharma
,
C. Yap
arXiv.org
2015
Corpus ID: 14270755
We describe a subdivision algorithm for isolating the complex roots of a polynomial F ∈ C[x]. Our model assumes that each…
Expand
2013
2013
Generalized Akiyama-Tanigawa Algorithm for Hypersums of Powers of Integers
J. Cereceda
,
E. Este
2013
Corpus ID: 14318621
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…
Expand
Review
2009
Review
2009
OpenMath in SCIEnce: SCSCP and POPCORN
Peter Horn
,
D. Roozemond
Calculemus/MKM
2009
Corpus ID: 1179240
In this short communication we want to give an overview of how OpenMath is used in the European project "SCIEnce" [12]. The main…
Expand
2000
2000
Equiripple minimum phase FIR filter design from linear phase systems using a novel technique for polynomial factorisation
I. Fotinopoulos
,
T. Stathaki
Global Communications Conference
2000
Corpus ID: 8803852
We propose a method for a minimum phase finite impulse response (FIR) equiripple filter design from a given linear phase FIR…
Expand
1996
1996
Blocked Iterative Sparse Linear System Solvers for Finite Fields
E. Kaltofen
1996
Corpus ID: 14155247
,
1996
1996
RESONANCE BASIS MAPS AND nPB TRACKING FOR DYNAMIC APERTURE STUDIES
J. Irwin
,
T. Chen
1996
Corpus ID: 16977291
Lie Algebraic methodsl implemented with truncated power series algebra packages2 or libraries,3 have become important in…
Expand
1995
1995
The Faber polynomials for annular sectors
J. Coleman
,
N. J. Myers
1995
Corpus ID: 123414114
A conformai mapping of the exterior of the unit circle to the exterior of a region of the complex plane determines the Faber…
Expand
1981
1981
Some inequalities about univariate polynomials
M. Mignotte
Symposium on Symbolic and Algebraic Manipulation
1981
Corpus ID: 35276667
This paper deals with the two following topics: bounds for the heights of divisors of polynomials, minimal distance between…
Expand
1964
1964
Factorization of polynomials over Banach algebras
J. A. Lindberg
1964
Corpus ID: 54502986
Introduction. A Banach algebra in this paper will be understood to mean a commutative, semi-simple Banach algebra with…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE