{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T05:41:43Z","timestamp":1736314903338,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540327554"},{"type":"electronic","value":"9783540327561"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11682462_51","type":"book-chapter","created":{"date-parts":[[2006,2,17]],"date-time":"2006-02-17T11:50:30Z","timestamp":1140177030000},"page":"544-555","source":"Crossref","is-referenced-by-count":2,"title":["Algorithms for Modular Counting of Roots of Multivariate Polynomials"],"prefix":"10.1007","author":[{"given":"Parikshit","family":"Gopalan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesan","family":"Guruswami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard J.","family":"Lipton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"51_CR1","volume-title":"Finite Fields, Encylopedia of Mathematics and Its Applications","author":"R. Lidl","year":"1997","unstructured":"Lidl, R., Niederreiter, H.: Finite Fields, Encylopedia of Mathematics and Its Applications. Cambridge University Press, Cambridge (1997)"},{"key":"51_CR2","unstructured":"Ehrenfeucht, A., Karpinski, M.: The computational complexity of (xor, and)- counting problems. Technical Report 8543-CS, ICSI, Berkeley (1990)"},{"issue":"2","key":"51_CR3","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1006\/jagm.1993.1014","volume":"14","author":"M. Karpinski","year":"1993","unstructured":"Karpinski, M., Luby, M.: Approximating the number of zeroes of a GF[2] polynomial. Journal of Algorithms\u00a014(2), 280\u2013287 (1993)","journal-title":"Journal of Algorithms"},{"key":"51_CR4","doi-asserted-by":"crossref","unstructured":"Grigoriev, D., Karpinski, M.: An approximation algorithm for the number of zeroes of arbitrary polynomials over GF[q]. In: 32nd IEEE Symposium on Foundations of Computer Science, pp. 662\u2013669 (1991)","DOI":"10.1109\/SFCS.1991.185433"},{"key":"51_CR5","doi-asserted-by":"crossref","unstructured":"Luby, M., Velickovi\u0107, B., Wigderson, A.: Deterministic approximate counting of depth-2 circuits. In: Israel Symposium on Theory of Computing Systems, pp. 18\u201324 (1993)","DOI":"10.1109\/ISTCS.1993.253488"},{"key":"51_CR6","doi-asserted-by":"publisher","first-page":"219","DOI":"10.5802\/jtnb.142","volume":"7","author":"R. Schoof","year":"1995","unstructured":"Schoof, R.: Counting points on elliptic curves over finite fields. J. Th\u00e9or. Nombres Bordeaux\u00a07, 219\u2013254 (1995)","journal-title":"J. Th\u00e9or. Nombres Bordeaux"},{"key":"51_CR7","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1090\/S0025-5718-1990-1035941-X","volume":"55","author":"J. Pila","year":"1990","unstructured":"Pila, J.: Frobenius maps of Abelian varieties and finding roots of unity in finite fields. Mathematics of Computation\u00a055, 745\u2013763 (1990)","journal-title":"Mathematics of Computation"},{"key":"51_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-61581-4_36","volume-title":"Algorithmic Number Theory","author":"L. Adleman","year":"1996","unstructured":"Adleman, L., Huang, M.D.: Counting rational points on curves and Abelian varieties over finite fields. In: Cohen, H. (ed.) ANTS 1996. LNCS, vol.\u00a01122, pp. 1\u201316. Springer, Heidelberg (1996)"},{"key":"51_CR9","unstructured":"Huang, M.D., Ierardi, D.: Counting rational points on curves over finite fields. In: Proceedings of the 34th IEEE Symposium on Foundations of Computer Science, pp. 616\u2013625 (1993)"},{"key":"51_CR10","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/BF01202042","volume":"6","author":"J. Gathen von zur","year":"1996","unstructured":"von zur Gathen, J., Karpinski, M., Shparlinski, I.: Counting curves and their projections. Computational Complexity\u00a06, 64\u201399 (1996)","journal-title":"Computational Complexity"},{"key":"51_CR11","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s000370050029","volume":"8","author":"M.D. Huang","year":"1999","unstructured":"Huang, M.D., Wong, Y.: Solvability of systems of polynomial congruences modulo a large prime. Journal of Computational Complexity\u00a08, 227\u2013257 (1999)","journal-title":"Journal of Computational Complexity"},{"key":"51_CR12","first-page":"135","volume":"225","author":"D. Wan","year":"1999","unstructured":"Wan, D.: Computing Zeta functions over finite fields. Contemporary Mathematics\u00a0225, 135\u2013141 (1999)","journal-title":"Contemporary Mathematics"},{"key":"51_CR13","first-page":"45","volume":"123","author":"D. Wan","year":"1995","unstructured":"Wan, D.: A Chevalley-Warning approach to p-adic estimate of character sums. Proceedings of the American Mathematical Society\u00a0123, 45\u201354 (1995)","journal-title":"Proceedings of the American Mathematical Society"},{"issue":"5","key":"51_CR14","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1137\/0220053","volume":"20","author":"S. Toda","year":"1991","unstructured":"Toda, S.: PP is as hard as the polynomial-time hierarchy. SIAM Journal on Computing\u00a020(5), 865\u2013877 (1991)","journal-title":"SIAM Journal on Computing"},{"key":"51_CR15","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: On ACC and threshold circuits. In: 31st IEEE Symposium on Foundations of Computer Science, pp. 619\u2013627 (1990)","DOI":"10.1109\/FSCS.1990.89583"},{"key":"51_CR16","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/BF01263423","volume":"4","author":"R. Beigel","year":"1994","unstructured":"Beigel, R., Tarui, J.: On ACC. Computational Complexity\u00a04, 350\u2013366 (1994)","journal-title":"Computational Complexity"},{"key":"51_CR17","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Vardy, A.: Maximum-likelihood decoding of Reed-Solomon codes is NP-hard. In: Proceedings of the ACM-SIAM symposium on Discrete Algorithms, pp. 470\u2013478 (2005)","DOI":"10.1109\/TIT.2005.850102"},{"key":"51_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511752490","volume-title":"Diophantine Equations Over Function Fields","author":"R.C. Mason","year":"1984","unstructured":"Mason, R.C.: Diophantine Equations Over Function Fields. Cambridge University Press, Cambridge (1984)"},{"key":"51_CR19","volume-title":"Algebra","author":"M. Artin","year":"1991","unstructured":"Artin, M.: Algebra. Prentice-Hall, Englewood Cliffs (1991)"},{"issue":"1","key":"51_CR20","doi-asserted-by":"publisher","first-page":"241","DOI":"10.2307\/2375042","volume":"117","author":"O. Moreno","year":"1995","unstructured":"Moreno, O., Moreno, C.J.: Improvements of the Chevalley-Warning and the Ax- Katz theorems. American Journal of Mathematics\u00a0117(1), 241\u2013244 (1995)","journal-title":"American Journal of Mathematics"},{"key":"51_CR21","volume-title":"Computational Complexity","author":"C. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading (1994)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2006: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11682462_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T20:07:56Z","timestamp":1736280476000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11682462_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327554","9783540327561"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11682462_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}