Randomized interpolation and approximation of sparse polynomials

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 623 LNCS, Issue , 1992, Pages 261-272

  Mansour, Yishay ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; AUTOMATA THEORY; POLYNOMIAL APPROXIMATION;

APPROXIMATE POLYNOMIALS; BIT COMPLEXITY; POLYNOMIAL-TIME; RANDOMIZED ALGORITHMS; SPARSE POLYNOMIALS;

POLYNOMIALS;

EID: 30244487846     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-55719-9_79     Document Type: Conference Paper

References (9)

1. M. Ben-Or and P. Tiwari. A deterministic algorithm for sparse multivariate polynomial interpolation. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pages 301-309, May 1988.
2. D. Y. Grigoriev and M. Katpinski. The matching problem for bipartite graphs with polynomial bounded permanents is in nc. In 2Bth Annual Symposium on Foundations of Computer Science, Los Angeles, California, pages 166-172, October 1987.
3. D. Y. Grigoriev, M. Katpinski, and M. Singer. Fast parallel algorithms for sparse multivariate polynomial interpolation over finite fields. Technical Report Research report no. 8523-CS, University of Bonn, 1988. to appear in Siam J. on Comp.
4. D. Y. Grigoriev, M. Katpinski, and M. Singer. Interpolation of sparse rational functions without knowing bounds on exponents. In 31th Annual Symposium on Foundations of Computer Science, St. Louis, pages 840-846, October 1990.
5. O. Goldteich and L. Levin. A hard-cote predicate for all one-way functions. In Proc. 21st ACM Symposium on Theory of Computing, pages 25-32. ACM, 1989.
6. Toiben Hagerup and Christine Rub. A guided torn to chernofT bounds. Info. Proc. Lett., 33:305-308, 1989.
7. M. Katpinski. Boolean circuit complexity of algebraic interpolation problems. Technical Report TR-89-027, ICSI, 1989.
8. Eyal Kushilevitz and Yishay Mansour. Learning decision trees using the fourier spectrum. In Proceedings of STOC '91, pages 455-464, may 1991.
9. R. E. Zippel. Probabilistic algorithms for sparse polynomials. In EUROSAM, pages 216-226. Springer Lecture notes in computer science, vol, 72, 1979.