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)

Semantic Scholar uses AI to extract papers important to this topic.

Review

2007

Review

2007

- Tsz-Wo Sze
- 2007

We show deterministic polynomial time algorithms over some family of finite fields for solving univariate polynomial equationsâ€¦Â (More)

Is this relevant?

2004

2004

- Zhonggang Zeng, Barry H. Dayton
- ISSAC
- 2004

This paper presents an algorithm and its implementation for computing the approximate GCD (greatest common divisor) ofâ€¦Â (More)

Is this relevant?

2004

2004

This paper presents an algorithm and its implementation for computing the approximate GCD (greatest common divisor) ofâ€¦Â (More)

Is this relevant?

2002

2002

- Driss Bouziane, M'hammed El Kahoui
- J. Symb. Comput.
- 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

- JÃ¼rgen Gerhard
- Applicable Algebra in Engineering, Communicationâ€¦
- 2001

We present new modular algorithms for the squarefree factorization of a primitive polynomial in â„¤[x] and for computing theâ€¦Â (More)

Is this relevant?

1993

1993

- George E. Collins, Werner Krandick
- ISSAC
- 1993

A straightforward implementation of Newtonâ€™s method for polynomial real root calculation using exact arithmetic is inefficientâ€¦Â (More)

Is this relevant?