Randomness efficient identity testing of multivariate polynomials
暂无分享,去创建一个
[1] Zhi-Zhong Chen,et al. Reducing randomness via irrational numbers , 1997, STOC '97.
[2] Noga Alon,et al. epsilon-Discrepancy Sets and Their Application for Interpolation of Sparse Polynomials , 1995, Inf. Process. Lett..
[3] Manindra Agrawal,et al. Primality and identity testing via Chinese remaindering , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[4] Aravind Srinivasan,et al. Randomness-Optimal Unique Element Isolation with Applications to Perfect Matching and Related Problems , 1995, SIAM J. Comput..
[5] Richard Zippel,et al. Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.
[6] V. Shoup. Searching for primitive roots in finite fields , 1990, Symposium on the Theory of Computing.
[7] Marek Karpinski,et al. Computational Complexity of Sparse Rational Interpolation , 1994, SIAM J. Comput..
[8] Carsten Lund,et al. Proof verification and the hardness of approximation problems , 1998, JACM.
[9] Aravind Srinivasan,et al. Randomness-optimal unique element isolation, with applications to perfect matching and related problems , 1993, SIAM J. Comput..
[10] Sanjeev Arora,et al. Probabilistic checking of proofs; a new characterization of NP , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[11] 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).
[12] Marek Karpinski,et al. On Zero-Testing and Interpolation of k-Sparse Multivariate Polynomials Over Finite Fields , 1991, Theor. Comput. Sci..
[13] Michael Ben-Or,et al. A deterministic algorithm for sparse multivariate polynomial interpolation , 1988, STOC '88.
[14] Gary L. Miller. Riemann's Hypothesis and Tests for Primality , 1976, J. Comput. Syst. Sci..
[15] Marek Karpinski,et al. On Some Approximation Problems Concerning Sparse Polynomials over Finite Fields , 1996, Theor. Comput. Sci..
[16] M. Rabin. Probabilistic algorithm for testing primality , 1980 .
[17] Adi Shamir,et al. IP = PSPACE , 1992, JACM.
[18] Vijay V. Vazirani,et al. Matching is as easy as matrix inversion , 1987, STOC.
[19] Jacob T. Schwartz,et al. Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.
[20] Gary L. Miller,et al. Riemann's Hypothesis and tests for primality , 1975, STOC.
[21] Salil P. Vadhan,et al. Checking polynomial identities over any field: towards a derandomization? , 1998, STOC '98.