Randomized Interpolation and Approximation of Sparse Polynomials
暂无分享,去创建一个
[1] Marek Karpinski,et al. Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields , 1988, SIAM J. Comput..
[2] Michael Ben-Or,et al. A deterministic algorithm for sparse multivariate polynomial interpolation , 1988, STOC '88.
[3] Leonid A. Levin,et al. A hard-core predicate for all one-way functions , 1989, STOC '89.
[4] Richard Zippel,et al. Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.
[5] Eyal Kushilevitz,et al. Learning decision trees using the Fourier spectrum , 1991, STOC '91.
[6] Torben Hagerup,et al. A Guided Tour of Chernoff Bounds , 1990, Inf. Process. Lett..
[7] 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.
[8] Marek Karpinski,et al. The matching problem for bipartite graphs with polynomially bounded permanents is in NC , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[9] Marek Karpinski. Boolean Complexity of Algebraic Interpolation Problems , 1988, CSL.