On Feasible Multivariate Polynomial Interpolations over Arbitrary Fields

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn 1999-January, Issue , 1999, Pages 67-74

  Zilic, Zeljko ^a   Radecka, Katarzyna ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; MATRIX ALGEBRA; POLYNOMIALS;

DETERMINISTIC ALGORITHMS; GENERALIZED VANDERMONDE MATRIX; INTERPOLATING POLYNOMIALS; MINIMAL DEGREE; MULTIVARIATE POLYNOMIAL; NONSINGULAR; NULL SPACE; POLYNOMIAL INTERPOLATION; UNIVARIATE;

INTERPOLATION;

EID: 84887138116     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/309831.309863     Document Type: Conference Paper

References (15)

1. BEN-OR, M., AND TIWARI, P. A deterministic algorithm for sparse multivariate polynomial interpolation. 20th Symposium on Theory of Computing (April 1988), 301-309.
2. BOJANOV, D., HAKOPIAN, H. A., AND SAHAKIAN, A. A. Spline Functions and Multivariate Interpolations. Kluwer Academic Publishers, 1993.
3. CLAUSEN, M., DRESS, A., GREBMEIER, J., AND KARPINSKI, M. On zero-testing and interpolation of k-sparse polynomials over finite fields. Theoretical Computer Science 84, 2 (January 1991), 151 164.
4. DE BOOR, C., AND RON, A. Computational aspects of polynomial interpolation in several variables. Mathematics of Computation 58 (1992), 705-727.
5. DUR, A., AND GRABMEIER, J. Applying coding theory to sparse interpolation. SIAM Journal of Computing 22, 4 (August 1993), 695-703.
6. GOLDREICII, O., RUBINEELD, R., AND SUDAN, M. Learning polynomials with queries: The highly noisy case. Report, Electronic Colloqium on Computational Complexity, August 1998.
7. GURUSWAMI, V., AND SUDAN, M. Improved decoding of reed-solomon and algebraic-geometric codes. In Symposium on Discrete Algorithms (Palo Alto, California, November, 1998), ACM-SIAM, pp. 108 117.
8. HUANG, M.-D. A., AND RAO, A. J. Interpolation of sparse multivariate polynomials over large finite fields. In Symposium on Discrete Algorithms (Altanta, Georgia, January, 1996), ACM-SIAM, pp. 508-517.
9. KNUTH, D. The Art of Computer Programming, 2nd Ed. Vol. 2: Seminumerical Algorithms. Addison-Wesley, Reading, Massachusetts, 1980.
10. ROTH, R. M., AND BENEDEK, G. M. Interpolation and approximation of sparse multivariate polynomials over GF(2). SIAM Journal of Computing 20, 2 (April 1991), 291-314.
11. SAUER, T. Polynomial interpolation of minimal degree. Numerische Mathematik Manuscript (to appear in 1996).
12. ZILIC, Z. Towards spectral synthesis: Field expansions for partial functions and logic modules for FPGAs. Phd dissertation, University of Toronto, Department of Electrical and Computer Engineering, January 1997.
13. ZILIC, Z., AND VRANESIC, Z. G. A multiple valued reed-muller transform for incompletely specified functions. IEEE Transactions on Computers 44, 8 (Aug. 1995.), 1012-1020.
14. ZIPPEL, R. Interpolating polynomials from their values. Journal of Symbolic Computation 9 (March 1990), 375-403.
15. ZIPPEL, R. Effective Polynomial Computation. Kluwer Academic Publishers, 1993.