Probalistic analyses of lattice reductions algorithms
Abstract
The general behaviour of lattice reduction algorithms is far from being well understood. Indeed, many experimental observations, regarding the execution of the algorithms and the geometry of their ouputs, pose challenging questions, which remain unanswered and lead to natural conjectures yet to be settled.
Origin : Publisher files allowed on an open archive
Loading...