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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2007
Review
2007
We show deterministic polynomial time algorithms over some family of finite fields for solving univariate polynomial equations… (More)
Is this relevant?
2004
2004
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
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
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
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 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?