Practical polynomial factoring in polynomial time

DOI10.1145/1993886.1993914zbMath1323.68603OpenAlexW2097890762MaRDI QIDQ5254167

No author found.

Publication date: 9 June 2015

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

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

zbMATH Keywords

symbolic computationfactoring polynomialslattice reduction

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Polynomials in general fields (irreducibility, etc.) (12E05)

Related Items (4)

The complexity of divisibility ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Computing the multilinear factors of lacunary polynomials without heights

This page was built for publication: Practical polynomial factoring in polynomial time