Algorithms for Modular Counting of Roots of Multivariate Polynomials
暂无分享,去创建一个
Venkatesan Guruswami | Richard J. Lipton | Parikshit Gopalan | R. Lipton | V. Guruswami | Parikshit Gopalan
[1] Seinosuke Toda,et al. PP is as Hard as the Polynomial-Time Hierarchy , 1991, SIAM J. Comput..
[2] Alan G. B. Lauder,et al. Counting points on varieties over finite fields of small characteristic , 2006, math/0612147.
[3] J. Pila. Frobenius maps of Abelian varieties and finding roots of unity in finite fields , 1990 .
[4] Ming-Deh A. Huang,et al. Solvability of systems of polynomial congruences modulo a large prime , 1999, computational complexity.
[5] K. Conrad. Finite Fields , 2004, Series and Products in the Development of Mathematics.
[6] Madhu Sudan,et al. Maximum-likelihood decoding of Reed-Solomon codes is NP-hard , 1996, IEEE Transactions on Information Theory.
[7] R. Tennant. Algebra , 1941, Nature.
[8] A. Ehrenfeucht,et al. The Computational Complexity of ({\it XOR, AND\/})-Counting Problems , 1990 .
[9] R. C. Mason. Diophantine Equations Over Function Fields , 1984 .
[10] Alan G. B. Lauder,et al. Computing zeta functions of Artin-Schreier curves over finite fields II , 2004, J. Complex..
[11] R. Schoof. Journal de Theorie des Nombres de Bordeaux 7 (1995), 219{254 , 2022 .
[12] Daqing Wan,et al. Computing Zeta Functions Over Finite Fields , 1998 .
[13] Marek Karpinski,et al. Approximating the number of zeroes of a GF[2] polynomial , 1991, SODA '91.
[14] H. Niederreiter,et al. Finite Fields: Encyclopedia of Mathematics and Its Applications. , 1997 .
[15] Avi Wigderson,et al. Deterministic approximate counting of depth-2 circuits , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.
[16] D. Wan,et al. A CHEVALLEY-WARNING APPROACH TO p-ADIC ESTIMATES OF CHARACTER SUMS , 1995 .
[17] Richard Beigel,et al. On ACC , 1994, computational complexity.
[18] Marek Karpinski,et al. An approximation algorithm for the number of zeros or arbitrary polynomials over GF(q) , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[19] Andrew Chi-Chih Yao,et al. ON ACC and threshold circuits , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[20] Kiran S. Kedlaya,et al. Computing Zeta Functions via p-Adic Cohomology , 2004, ANTS.
[21] Leslie G. Valiant,et al. Accidental Algorithms , 2006, FOCS.
[22] Leslie G. Valiant,et al. Completeness for Parity Problems , 2005, COCOON.
[23] Leslie G. Valiant,et al. NP is as easy as detecting unique solutions , 1985, STOC '85.
[24] Marek Karpinski,et al. Counting curves and their projections , 1993, computational complexity.
[25] Leonard M. Adleman,et al. Counting Rational Points on Curves and Abelian Varieties over Finite Fields , 1996, ANTS.
[26] Christos H. Papadimitriou,et al. Computational complexity , 1993 .
[27] Ming-Deh A. Huang,et al. Counting rational points on curves over finite fields , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[28] Rudolf Lide,et al. Finite fields , 1983 .
[29] Leslie G. Valiant,et al. The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..
[30] O. Moreno,et al. Improvements of the Chevalley-Warning and the Ax-Katz Theorems , 1995 .