Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials

Mark van Hoeij, Andrew Novocin. Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials. In Alejandro López-Ortiz, editor, LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings. Volume 6034 of Lecture Notes in Computer Science, pages 539-553, Springer, 2010. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.