In mathematics and computer algebra the factorization of a polynomial consists of decomposing it into a product of irreducible factors. Thisâ€¦Â (More)

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

2015

2015

- Anand Kumar Narayanan
- ArXiv
- 2015

We propose and rigorously analyze two randomized algorithms to factor univariate polynomials over finite fields using rank 2â€¦Â (More)

Is this relevant?

2013

2013

- Daniel Panario
- 2013

Polynomials appear in many research articles of Philippe Flajolet. Here we concentrate only in papers where polynomials play aâ€¦Â (More)

Is this relevant?

2010

2010

- Hiroshi Gunji, Dennis Amon, Hiroshi Gunji
- 2010

Let fix) be a polynomial over a finite field F. An algorithm for determining the degrees of the factors of fix) is presented. Asâ€¦Â (More)

Is this relevant?

2004

2004

- Shuhong Gao, Erich Kaltofen, Alan G. B. Lauder
- J. Symb. Comput.
- 2004

A deterministic polynomial time algorithm is presented for finding the distinctdegree factorization of multivariate polynomialsâ€¦Â (More)

Is this relevant?

2004

2004

- G. J. van der Heiden
- Math. Comput.
- 2004

After my paper [2] was electronically published by Mathematics of Computation, I came across the PhD thesis of professor I. Yâ€¦Â (More)

Is this relevant?

Review

2002

Review

2002

- Masayuki Noro, Kazuhiro Yokoyama
- ISSAC
- 2002

Polynomial factorization plays a significant role in computational mathematics and its application to engineering, since it formsâ€¦Â (More)

Is this relevant?

Highly Cited

1993

1991

1991

- Ming-Deh A. Huang
- J. Algorithms
- 1991

It is shown that factoring polynomials over finite prime fields is polynomial-time equivalent to decomposing primes in algebraicâ€¦Â (More)

Is this relevant?

1987

1987

- Lajos RÃ³nyai
- 28th Annual Symposium on Foundations of Computerâ€¦
- 1987

We propose a new deterministic method of factoring polynomials over finite fields. Assuming the Generalized Riemann Hypothesisâ€¦Â (More)

Is this relevant?

1984

1984

- Ming-Deh A. Huang
- STOC
- 1984

Based on Kummer Theorem, we study the deterministic complexity of two factorization problems: polynomial factorization overâ€¦Â (More)

Is this relevant?