Reconstructing algebraic functions from mixed data

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 1992-October, Issue , 1992, Pages 503-512

  Ar, Sigal ^a   Lipton, Richard J ^a   Rubinfeld, Ronitt ^b   Sudan, Madhu ^c  

^a PRINCETON UNIVERSITY   (United States)

^b Department of Obstetrics Gynecology   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER VISION; CURVE FITTING; LEARNING SYSTEMS; POLYNOMIAL APPROXIMATION;

ALGEBRAIC FUNCTIONS; BIVARIATE POLYNOMIALS; BLACK BOXES; MIXED DATA; SAME POINTS;

FUNCTIONS;

EID: 85044551501     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.1992.267801     Document Type: Conference Paper

References (29)

1. D. Beaver and J. Feigenbaum. Hiding Instance in Multioracle Queries. In STACS1990
2. M. Ben-Or. Probabilistic Algorithms in Finite Fields In Proc. 22 nd IEEE Symposium on Foundations of Computer Science, pages 394-398, 1981.
3. M. Ben-Or and P. Tiwari. A Deterministic Algorithm for Sparse Multivariate Polynomial Interpolation. In Proc. 20th STOC, pages 301-309, 1988.
4. E. Berlekamp. Factoring Polynomials over Large Finite Fields. Mathematics of Computation, page 713, vol. 24, no. 111, 1970.
5. E. Berlekamp and L. Welch. Error Correction of Algebraic Block Codes. US Patent Number 4, 633, 470
6. A. Blum and P. Chalasani. Learning Switching Concepts. In Proc. 5th Annual Workshop on Computational Learning Theory, pages 231-242, 1992.
7. M. Blum, M. Luby and R. Rubinfeld. Self-lesting/Correcting with Applications to Numerical Problems. In Proc. 22nd ACM Symposium on Theory of Computing, 1990.
8. J.Y. Cai and L. Hemachandra. A note on enumerative counting. Information Processing Letters 38 (1991) pp. 215-219.
9. Canny J., 1983. Finding edges and lines in images. Mil., Arificial Intelligence Laboratory Report, AI-TR-720.
10. P. Gemmell, R. Lipton, R. Rubinfeld, M. Sudan and A. Wigderson. Self-Testing/Correcting for Polynomials and for Approximate Functions. In Proc. 23rd ACM Symposium on Theory of Computing, 1991.
11. P. Gemmell andM. Sudan. Highly resilient correctors for polynomials. To appearinlnformationProcessing Letters.
12. D. Grigoriev. Factorization of Polynomials over a Finite Field and the Solution of Systems of Algebraic Equations. Translated from Zapiski Nauchnykh Sem-inarov Lenningradskogo Otdeleniya Matematich-eskogo Instituta im. V. A. Steklova AN SSSR, Vol. 137, pp. 20-79, 1984.
13. D. Grigoriev and A. Chistov. Fast decomposition of polynomials into irreducible ones and the solution of systems of algebraic equations. Soviet Math. Doklady, 29(1984)380-383.
14. D. Grigoriev and M. Karpinski. Algorithms for Sparse Rational Interpolation. ICSI Tech. Report, TR-91-011, January 1991.
15. D. Grigoriev, M. Karpinski, MF. Singer. Interpolation of Sparse Rational Functions Without Knowing Bounds on Exponents. Institut fur Informatik der University Bonn, Report No. 8539-CS, Nov. 1989.
16. D. Grigoriev, M. Karpinski, M.F. Singer. Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields. SLAM J. Comput., Vol. 19, No. 6, pp 1059-1063, Dec. 1990.
17. J. Henderson and R. Quandt. Microeoonomic Theory, McGraw Hill Book Company, 1958, 1971.
18. E. Kaltofen. A Polynomial-Time Reduction from Bi-variate to Univariate Integral Polynomial Factorization. In 23rd Annual Symposium on Foundations of Computer Science, pages 57-64, 1982.
19. E. Kaltofen and B. Trager. Computing with Polynomials Given by Black Boxes for Their Evaluations: Greatest Common Divisors, Factorization, Separation of Numerators and Denominators. In 29th Annual Symposium on Foundations of Computer Science, pages 296-305, 1988.
20. R. Lidl and H. Niederreiter. Introduction to finite fields and their applications. Cambridge University Press, 1986
21. R. Lipton. New directions in testing. In Distributed Computing and Cryptography, DLMACS Series on Discrete Mathematics and Theoretical Computer Science, pages 191-202, v. 2, 1991.
22. A. K. Lenstra, H. W. Lenstra and L. Lovasz. Factoring polynomials with rational coefficients. Math. Ann., 261 (1982), 515-534.
23. Marr D. & Hildreth E., 1980. "Theory of Edge Detection". Proceeding of the Royal Society London, B207, pp. 187-217.
24. R. Rivest. Learning Decision Lists. Machine Learning, 2(3), pages 229-246, 1987.
25. TJ. Rivlin. An Introduction of the Approximation of Functions. Dover Publications, 1969.
26. Van der Waerden. Algebra, Volume 1. Frederick Ungar Publishing Co., Inc., page 82.
27. R. J. Walker. Algebraic Curves. Dover Publications, 1962
28. R.E. Zippel. Probabilistic Algorithms for Sparse Polynomials. In Proc. EUROSAM '79, Springer Verlag LNCS, pages 216-226, v. 72, 1979.
29. R.E. Zippel. Interpolating Polynomials from their Values. J. Symbolic Computation 9, pages 375-403, 1990.