Factoring polynomials over arbitrary finite fields

DOI10.1016/S0304-3975(99)00291-1MaRDI QIDQ1575686zbMATH OpenOpenAlexFDO

Authors Tanja Lange, Arne Winterhof

Publication date 21 August 2000

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(99)00291-1

zbMATH Keywords

deterministic algorithmaverage case analysisarbitrary finite fieldsfactorisation of polynomials

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On the deterministic complexity of factoring polynomials over finite fields
• scientific article; zbMATH DE number 1594303
• On a New Factorization Algorithm for Polynomials Over Finite Fields

Cites work

• scientific article; zbMATH DE number 429512 (Why is no real title available?)
• scientific article; zbMATH DE number 3822792 (Why is no real title available?)
• scientific article; zbMATH DE number 52177 (Why is no real title available?)
• scientific article; zbMATH DE number 1273636 (Why is no real title available?)
• scientific article; zbMATH DE number 3265895 (Why is no real title available?)
• Computing Frobenius maps and factoring polynomials
• Equations over finite fields. An elementary approach
• On the deterministic complexity of factoring polynomials over finite fields
• On the distribution of powers in finite fields
• Subquadratic-time factoring of polynomials over finite fields
• Univariate polynomial factorization over finite fields

Cited in

(21)

• Deterministic distinct-degree factorization of polynomials over finite fields
• Factoring a binary polynomial of degree over one million
• scientific article; zbMATH DE number 3893305 (Why is no real title available?)
• scientific article; zbMATH DE number 6500356 (Why is no real title available?)
• Deterministic analysis of aleatoric methods of polynomial factorization over finite fields
• A New Algorithm for Factoring Polynomials Over Finite Fields
• scientific article; zbMATH DE number 953230 (Why is no real title available?)
• Practical polynomial factoring in polynomial time
• Factorization of composite polynomials over finite fields
• Factoring polynomials over special finite fields
• The complete analysis of a polynomial factorization algorithm over finite fields
• A Deterministic Algorithm for Factorizing Polynomials over Extensions GF(p^m) of GF(p), p a Small Prime
• scientific article; zbMATH DE number 1594303 (Why is no real title available?)
• Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers
• Factorization of polynomials over finite fields and characteristic sequences
• Factoring polynomials over global fields. II.
• On the deterministic complexity of factoring polynomials over finite fields
• Factoring polynomials using binary representations of finite fields
• Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes
• Using zeta functions to factor polynomials over finite fields
• Factoring polynomials over finite fields: A survey

This page was built for publication: Factoring polynomials over arbitrary finite fields

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