Do you know value of coefficient $C$ at $C*n*log(n)$ in $O(n*log(n))$ estimation of complexity of polynomial division algorithm?
It would be great if you give me links to paper with information about it.
UPD.1 By complexity I meant arithmetic complexity
UPD.2 Estimation $O(n*log(n))$ one can find in §8 of book Alfred V. Aho, J.E. Hopcroft, Jeffrey D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley Series in Computer Science and Information Processing (1974).
