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. Algorithmica, 63(3):616-633, 2012. [doi]

@article{HoeijN12,
  title = {Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials},
  author = {Mark van Hoeij and Andrew Novocin},
  year = {2012},
  doi = {10.1007/s00453-011-9500-y},
  url = {http://dx.doi.org/10.1007/s00453-011-9500-y},
  researchr = {https://researchr.org/publication/HoeijN12},
  cites = {0},
  citedby = {0},
  journal = {Algorithmica},
  volume = {63},
  number = {3},
  pages = {616-633},
}