Factoring polynomials over finite fields using balance test

DOI10.4230/LIPICS.STACS.2008.1323MaRDI QIDQ4910754zbMATH OpenFDO

Authors Chandan Saha

Publication date 19 March 2013

Full work available at URL http://subs.emis.de/LIPIcs/frontdoor_7d97.html

zbMATH Keywords

algebraic algorithmsfinite fieldspolynomial factorization

Mathematics Subject Classification ID

Polynomials in real and complex fields: factorization (12D05) Symbolic computation and algebraic computation (68W30) Analysis of algorithms (68W40)

Recommendations

• Smoothness and factoring polynomials over finite fields
• Factoring polynomials over finite fields
• On the deterministic complexity of factoring polynomials
• scientific article; zbMATH DE number 1594303
• On the deterministic complexity of factoring polynomials over finite fields

Cited in

(2)

• Deterministic root finding over finite fields using Graeffe transforms
• Efficient algorithms for finite \(\mathbb{Z}\)-algebras

This page was built for publication: Factoring polynomials over finite fields using balance test

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