FAQ

Square-free polynomial

Known as: Square-free factorization, Polynomial with no repeated roots, Squarefree factorization 
In mathematics, a square-free polynomial is a polynomial defined over a field (or more generally, a unique factorization domain) that does not have… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1993-2007
01219932007

Related topics

Related topics

12 relations
Berlekamp's algorithmComputational complexity theoryComputer algebra systemFactorization of polynomials
(More)

Related mentions per year

Related mentions per year

1938-2018
19401960198020002020
Square-free polynomial
Polynomial
Computational complexity theory
Resultant
Computer algebra system
Irreducible polynomial

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2007
Review
2007
On Solving Univariate Polynomial Equations over Finite Fields and Some Related Problems
We show deterministic polynomial time algorithms over some family of finite fields for solving univariate polynomial equations… (More)
Is this relevant?
2004
2004
The approximate GCD of inexact polynomials
This paper presents an algorithm and its implementation for computing the approximate GCD (greatest common divisor) of… (More)
  • table 3
  • table 1
  • table 4
  • table 2
  • table 6
Is this relevant?
2004
2004
The approximate GCD of inexact polynomials Part II: a multivariate algorithm
This paper presents an algorithm and its implementation for computing the approximate GCD (greatest common divisor) of… (More)
  • table 3
  • table 1
  • table 4
  • table 2
  • table 6
Is this relevant?
2002
2002
Computation of the Dual of a Plane Projective Curve
The notion of duality plays a fundamental role in plane projective geometry. Roughly speaking, it can be stated as follows: any… (More)
Is this relevant?
2001
2001
Fast Modular Algorithms for Squarefree Factorization and Hermite Integration
We present new modular algorithms for the squarefree factorization of a primitive polynomial in ℤ[x] and for computing the… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
1993
1993
A Hybrid Method for High Precision Calculation of Polynomial Real Roots
A straightforward implementation of Newton’s method for polynomial real root calculation using exact arithmetic is inefficient… (More)
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?