Factoring polynomials over arbitrary finite fields

DOI10.1016/S0304-3975(99)00291-1zbMath0947.68075OpenAlexW2169081122MaRDI QIDQ1575686

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

average case analysisdeterministic algorithmarbitrary finite fieldsfactorisation of polynomials

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (1)

Factoring polynomials over finite fields: A survey

Cites Work

• On the deterministic complexity of factoring polynomials over finite fields
• Univariate polynomial factorization over finite fields
• Equations over finite fields. An elementary approach
• On the distribution of powers in finite fields
• Computing Frobenius maps and factoring polynomials
• Subquadratic-time factoring of polynomials over finite fields
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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