We will learn some divide and conquer algorithms for Integer Multiplication (Karatsuba’s Algorithm), Matrix Multiplication (Strassen’s Algorithm), Fast Fourier Transforms (FFTs), and Finding Closest ...

See (M2) Reduced basis generation for example usage information. The entry point for the greedy algorithm is the method basis_extension(). See there for more details on the algorithm . Definition at ...