Hart, William; van Hoeij, Mark; Novocin, Andrew Practical polynomial factoring in polynomial time. (English) Zbl 1323.68603 Leykin, Anton (ed.), Proceedings of the 36th international symposium on symbolic and algebraic computation, ISSAC 2011, San Jose, CA, USA, June 7–11, 2011. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-0675-1). 163-170 (2011). Cited in 4 Documents MSC: 68W30 Symbolic computation and algebraic computation 12E05 Polynomials in general fields (irreducibility, etc.) 68Q25 Analysis of algorithms and problem complexity Keywords:factoring polynomials; lattice reduction; symbolic computation PDFBibTeX XMLCite \textit{W. Hart} et al., in: Proceedings of the 36th international symposium on symbolic and algebraic computation, ISSAC 2011, San Jose, CA, USA, June 7--11, 2011. New York, NY: Association for Computing Machinery (ACM). 163--170 (2011; Zbl 1323.68603) Full Text: DOI