Schemes for deterministic polynomial factoring

DOI10.1145/1576702.1576730MaRDI QIDQ2883816zbMATH OpenOpenAlexWikidataFDO

Authors Gábor Ivanyos, Nitin Saxena, Marek Karpinski

Publication date 13 May 2012

Published in Proceedings of the 2009 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1576702.1576730

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials over finite fields (11T06)

Recommendations

• Deterministic polynomial factoring and association schemes
• Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes
• On the deterministic complexity of factoring polynomials
• Trading GRH for algebra: algorithms for factoring polynomials and related structures
• scientific article; zbMATH DE number 799779

Cited in

(9)

• A verified implementation of the Berlekamp-Zassenhaus factorization algorithm
• Extensibility of association schemes and GRH-based deterministic polynomial factoring
• Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes
• Practical polynomial factoring in polynomial time
• Strongly regular graphs with the \(7\)-vertex condition
• Deterministic polynomial factoring and association schemes
• scientific article; zbMATH DE number 7559413 (Why is no real title available?)
• A deterministic algorithm for integer factorization
• Trading GRH for algebra: algorithms for factoring polynomials and related structures

This page was built for publication: Schemes for deterministic polynomial factoring

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