Deterministic analysis of aleatoric methods of polynomial factorization over finite fields

DOI10.1006/JNTH.1994.1024zbMATH Open0802.11055OpenAlexW1983297160MaRDI QIDQ1323866FDOQ1323866

Authors: M. Rothstein, H. Zassenhaus 

Publication date: 15 December 1994

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jnth.1994.1024

Recommendations

• On a New Factorization Algorithm for Polynomials Over Finite Fields
• On the deterministic complexity of factoring polynomials
• Factoring polynomials over arbitrary finite fields
• scientific article; zbMATH DE number 3880116
• Computing Frobenius maps and factoring polynomials

zbMATH Keywords

complexityfinite fieldmonic polynomialsCantor-Zassenhaus algorithmdeterministic factorization algorithm

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Number-theoretic algorithms; complexity (11Y16)

Cited In (12)

• Title not available (Why is that?)
• Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers
• A verified implementation of the Berlekamp-Zassenhaus factorization algorithm
• Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes
• Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant
• Deterministic root finding in finite fields
• Title not available (Why is that?)
• A Deterministic Algorithm for Factorizing Polynomials over Extensions GF(p^m) of GF(p), p a Small Prime
• Factoring polynomials over finite fields: A survey
• Improving the Berlekamp algorithm for binomials \(x^{n}-a\)
• Subquadratic-time factoring of polynomials over finite fields
• Title not available (Why is that?)

This page was built for publication: Deterministic analysis of aleatoric methods of polynomial factorization over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1323866)