Interpolation and Approximation of Sparse Multivariate Polynomials over GF(2)
暂无分享,去创建一个
[1] Leslie G. Valiant,et al. On the learnability of Boolean formulae , 1987, STOC.
[2] Gadiel Seroussi,et al. Vector sets for exhaustive testing of logic circuits , 1988, IEEE Trans. Inf. Theory.
[3] Marek Karpinski,et al. On Zero-Testing and Interpolation of k-Sparse Multivariate Polynomials Over Finite Fields , 1991, Theor. Comput. Sci..
[4] Leslie G. Valiant,et al. Learning Disjunction of Conjunctions , 1985, IJCAI.
[5] Marek Karpinski,et al. Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields , 1988, SIAM J. Comput..
[6] Michael Ben-Or,et al. A deterministic algorithm for sparse multivariate polynomial interpolation , 1988, STOC '88.
[7] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .
[8] Leslie G. Valiant,et al. A theory of the learnable , 1984, CACM.
[9] Leslie G. Valiant,et al. Computational limitations on learning from examples , 1988, JACM.
[10] Robert J. McEliece,et al. The Theory of Information and Coding , 1979 .
[11] Carl H. Smith,et al. Inductive Inference: Theory and Methods , 1983, CSUR.
[12] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .