Factoring polynomials over arbitrary finite fields

DOI10.1016/S0304-3975(99)00291-1zbMATH Open0947.68075OpenAlexW2169081122MaRDI QIDQ1575686FDOQ1575686

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

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

zbMATH Keywords

deterministic algorithmaverage case analysisarbitrary finite fieldsfactorisation of polynomials

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• On the deterministic complexity of factoring polynomials over finite fields
• Equations over finite fields. An elementary approach
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computing Frobenius maps and factoring polynomials
• Title not available (Why is that?)
• Subquadratic-time factoring of polynomials over finite fields
• Univariate polynomial factorization over finite fields
• On the distribution of powers in finite fields
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (21)

• Title not available (Why is that?)
• Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers
• A New Algorithm for Factoring Polynomials Over Finite Fields
• Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes
• Title not available (Why is that?)
• Practical polynomial factoring in polynomial time
• Title not available (Why is that?)
• Deterministic distinct-degree factorization of polynomials over finite fields
• On the deterministic complexity of factoring polynomials over finite fields
• Factorization of polynomials over finite fields and characteristic sequences
• Factoring a binary polynomial of degree over one million
• 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
• Using zeta functions to factor polynomials over finite fields
• Deterministic analysis of aleatoric methods of polynomial factorization over finite fields
• Factorization of composite polynomials over finite fields
• The complete analysis of a polynomial factorization algorithm over finite fields
• Factoring polynomials using binary representations of finite fields
• Title not available (Why is that?)
• Factoring polynomials over global fields. II.
• Factoring polynomials over special finite fields

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)