登入
選單
返回
Google圖書搜尋
Computational Complexity of Sparse Rational Interpolation
International Computer Science Institute
Dima Grigoriev
M. Karpinski
Michael F. Singer
出版
International Computer Science Institute
, 1991
URL
http://books.google.com.hk/books?id=4rfYGwAACAAJ&hl=&source=gbs_api
註釋
Abstract: "We analyze the computational complexity of sparse rational interpolation, and give the first genuine time (arithmetic complexity does not depend on the size of the coefficients) algorithm for this problem."
