Grigoriev D., Karpinski M., Singer M.F. — Computational Complexity of Sparse Rational Interpolation
Обсудите книгу на
Нашли опечатку? Выделите ее мышкой и нажмите Ctrl+Enter
Название: 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.
|
|
О проекте