Algorithms for multiplication #28
Description
There are various algorithms for multiplication of two affine forms.
Currently we are using one that is O(n^2), where n is the length of the vectors in the affine expression, but presumably gives more accurate answers.
However there should be a mechanism to choose a more efficient one (O(n)).