Content deleted Content added
→Fourier transform methods: Clarify: Base 10 is used in place of base 2<sup>''w''</sup> for illustrative purposes. |
|||
Line 369:
===Linear time multiplication===
sure 4 linear mul div n roots just try error control on this idea: 1/(1+x)=1-x,x<<1 working from MSB to LSB ttyl ,Florin
Knuth<ref>{{Citation | last1=Knuth | first1=Donald E. | author1-link=Donald Knuth | title=The Art of Computer Programming volume 2: Seminumerical algorithms | publisher=[[Addison-Wesley]] | year=1997 | pages=311}}
| |||