
The Fincke-Pohst Algorithm 175
10.5 Projects
Project 10.1. Implement a recursive version of the Fincke-Pohst algorithm:
replace the main loop by a recursive procedure call. Compare the time and
space usage of the two algorithms on a number of examples.
Project 10.2. Implement o n a computer the two versions of the Fincke-
Pohst algorithm: the firs t (original) version, and the second version with LLL
preprocessing. Run both versions on the same sample of lattices of dimensions
up to 20 (or higher, if sufficient computer time and memory are available).
Keep track of the exec ution times; for the second algorithm, keep track of both
the time for LLL prepro ...