Awaiting product image

Computational Complexity of Sparse Rational Interpolation

Free Download

Authors:

Size: 183 kB (187688 bytes)

Pages: 12/19

File format:

Language:

Publishing Year:

Direct Download: Coming soon..
Download link:
Sign in to view hidden content.
Category:

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.

Reviews

There are no reviews yet.

Be the first to review “Computational Complexity of Sparse Rational Interpolation”

Related products

Shopping Cart
Scroll to Top