1. it seems that algorithms with less computational complexity than mere Horner's scheme exist, for example (covers some background in the introduction): https://ens-lyon.hal.science/ensl-00546102/document 2. There should be special code for the case where one or both polynomials have their (small) degree in the type domain (`ImmutablePolynomial`)