Factoring polynomials over finite fields using balance test

DOI10.4230/LIPICS.STACS.2008.1323zbMATH Open1259.68245MaRDI QIDQ4910754FDOQ4910754

Authors: Chandan Saha 

Publication date: 19 March 2013

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

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

zbMATH Keywords

finite fieldsalgebraic algorithmspolynomial factorization

Mathematics Subject Classification ID

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

Cited In (2)

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

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)