Improved Sparse Multivariate Polynomial Interpolation Algorithms
暂无分享,去创建一个
[1] Michael Ben-Or,et al. A deterministic algorithm for sparse multivariate polynomial interpolation , 1988, STOC '88.
[2] Jeffrey D. Smith,et al. Design and Analysis of Algorithms , 2009, Lecture Notes in Computer Science.
[3] R. Blahut. Theory and practice of error control codes , 1983 .
[4] Richard Zippel,et al. Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.
[5] David Y. Y. Yun,et al. Fast Solution of Toeplitz Systems of Equations and Computation of Padé Approximants , 1980, J. Algorithms.
[6] Richard Zippel,et al. Interpolating Polynomials from Their Values , 1990, J. Symb. Comput..
[7] Marek Karpinski,et al. The matching problem for bipartite graphs with polynomially bounded permanents is in NC , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[8] Alfred V. Aho,et al. The design and analysis of algorithms , 1974 .
[9] Joseph F. Traub,et al. On Euclid's Algorithm and the Theory of Subresultants , 1971, JACM.
[10] Rüdiger Loos. Computing Rational Zeros of Integral Polynomials by p-adic Expansion , 1983, SIAM J. Comput..
[11] Erich Kaltofen,et al. Solving systems of nonlinear polynomial equations faster , 1989, ISSAC '89.
[12] Erich Kaltofen,et al. Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.