Computational Complexity of Sparse Rational Interpolation
Grigoriev D., Karpinski M., Singer M.F.
The authors analyze the computational complexity of sparse rational interpolation, and give the first deterministic algorithm for this problem with singly exponential bounds on the number of arithmetic operations.
Ссылка удалена правообладателем
----
The book removed at the request of the copyright holder.
