Factorization of univariate integer polynomials by diophantine approximation and an improved basis reduction algorithm
- 1 January 1984
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 436-447
- https://doi.org/10.1007/3-540-13345-3_40
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- On the complexity of finding short vectors in integer latticesLecture Notes in Computer Science, 1983
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982