a variety of small changes; in the Quarter square method it seems like floor isn't necessary but didn't really change anything since it might be some implicit computer operation thing
→Polynomial multiplication: remove the sentence on "Strassen algorithm for polynomials" which was simply wrong, with a reference to a bad presentation to Karatsuba's algorithm without its name
All the above multiplication algorithms can also be expanded to multiply [[polynomial]]s. For instanceAlternatively the Strassen[[Kronecker substitution]] algorithmtechnique may be used forto polynomialconvert the problem of multiplying polynomials into a single binary multiplication.<ref>{{citecitation web|urlfirst1 =http://everything2.com/title/Strassen+algorithm+for+polynomial+multiplication Joachim |titlelast1 =Strassenalgorithmvon forzur polynomialGathen multiplication| author1-link = Joachim von zur Gathen |first2 = Jürgen | last2 = Gerhard |title = Modern Computer Algebra |publisher =Everything2 Cambridge University Press |year = 1999 |isbn = 978-0-521-64176-0 |pages = 243–244 |url = https://books.google.com/books?id=AE5PN5QGgvUC&pg=PA245 }}.</ref>
Alternatively the [[Kronecker substitution]] technique may be used to convert the problem of multiplying polynomials into a single binary multiplication.<ref>{{citation |first1 = Joachim |last1 = von zur Gathen | author1-link = Joachim von zur Gathen |first2 = Jürgen | last2 = Gerhard |title = Modern Computer Algebra |publisher = Cambridge University Press |year = 1999 |isbn = 978-0-521-64176-0 |pages = 243–244 |url = https://books.google.com/books?id=AE5PN5QGgvUC&pg=PA245 }}.</ref>
Long multiplication methods can be generalised to allow the multiplication of algebraic formulae:
