### Reconstructing Algebraic Functions from Mixed Data

暂无分享，去创建一个

[1] David Haussler,et al. Decision Theoretic Generalizations of the PAC Model for Neural Net and Other Learning Applications , 1992, Information and Computation.

[2] Richard Zippel. Interpolating Polynomials from Their Values , 1990, J. Symb. Comput..

[3] Erich Kaltofen. A Polynomial-Time Reduction from Bivariate to Univariate Integral Polynomial Factorization , 1982, FOCS.

[4] Avrim Blum,et al. Learning switching concepts , 1992, COLT '92.

[5] J. Gathen. Algebraic complexity theory , 1988 .

[6] D Marr,et al. Theory of edge detection , 1979, Proceedings of the Royal Society of London. Series B. Biological Sciences.

[7] Madhu Sudan,et al. Highly Resilient Correctors for Polynomials , 1992, Inf. Process. Lett..

[8] Marek Karpinski,et al. Interpolation of sparse rational functions without knowing bounds on exponents , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[9] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .

[10] R. J. Walker. Algebraic curves , 1950 .

[11] Leslie G. Valiant,et al. A theory of the learnable , 1984, STOC '84.

[12] Ronitt Rubinfeld,et al. A new modular interpolation algorithm for factoring multivariate polynominals , 1994, ANTS.

[13] Rajeev Motwani,et al. Randomized algorithms , 1996, CSUR.

[14] Jin-Yi Cai,et al. A Note on Enumarative Counting , 1991, Inf. Process. Lett..

[15] Manuel Blum,et al. Self-testing/correcting with applications to numerical problems , 1990, STOC '90.

[16] Madhu Sudan. Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..

[17] Michael Ben-Or,et al. Probabilistic algorithms in finite fields , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[18] Richard Zippel,et al. Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.

[19] E. Berlekamp. Factoring polynomials over large finite fields , 1970 .

[20] Ronitt Rubinfeld,et al. Learning polynomials with queries: The highly noisy case , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[21] 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.

[22] D. Grigor'ev,et al. Factorization of polynomials over a finite field and the solution of systems of algebraic equations , 1986 .

[23] Richard J. Lipton,et al. New Directions In Testing , 1989, Distributed Computing And Cryptography.

[24] David Haussler,et al. Occam's Razor , 1987, Inf. Process. Lett..

[25] Elwyn R. Berlekamp. Bounded distance+1 soft-decision Reed-Solomon decoding , 1996, IEEE Trans. Inf. Theory.

[26] Marek Karpinski,et al. Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields , 1988, SIAM J. Comput..

[27] Michael Ben-Or,et al. A deterministic algorithm for sparse multivariate polynomial interpolation , 1988, STOC '88.

[28] Harald Niederreiter,et al. Introduction to finite fields and their applications: List of Symbols , 1986 .

[29] Eyal Kushilevitz,et al. Learning decision trees using the Fourier spectrum , 1991, STOC '91.