{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:01Z","timestamp":1760202601098},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642145520"},{"type":"electronic","value":"9783642145537"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-14553-7_16","type":"book-chapter","created":{"date-parts":[[2010,7,26]],"date-time":"2010-07-26T03:59:21Z","timestamp":1280116761000},"page":"148-159","source":"Crossref","is-referenced-by-count":5,"title":["On Tractable Exponential Sums"],"prefix":"10.1007","author":[{"given":"Jin-Yi","family":"Cai","sequence":"first","affiliation":[]},{"given":"Xi","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Richard","family":"Lipton","sequence":"additional","affiliation":[]},{"given":"Pinyan","family":"Lu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","volume-title":"Algebraic Number Theory","author":"S. Lang","year":"1970","unstructured":"Lang, S.: Algebraic Number Theory. Addison-Wesley, Reading (1970)"},{"key":"16_CR2","volume-title":"Introduction to Number Theory","author":"L. Hua","year":"1982","unstructured":"Hua, L.: Introduction to Number Theory. Springer, Heidelberg (1982)"},{"key":"16_CR3","volume-title":"A Classical Introduction to Modern Number Theory","author":"K. Ireland","year":"1998","unstructured":"Ireland, K., Rosen, M.: A Classical Introduction to Modern Number Theory. Springer, Heidelberg (1998)"},{"key":"16_CR4","unstructured":"Goldberg, L., Grohe, M., Jerrum, M., Thurley, M.: A complexity dichotomy for partition functions with mixed signs. In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, pp. 493\u2013504 (2009)"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Cai, J.Y., Chen, X., Lu, P.: Graph homomorphisms with complex values: A dichotomy theorem. In: Proceedings of the 37th International Colloquium on Automata, Languages and Programming (2010)","DOI":"10.1007\/978-3-642-14165-2_24"},{"key":"16_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-55826-9","volume-title":"Computer Algebra Handbook","author":"J. Grabmeier","year":"2003","unstructured":"Grabmeier, J., Kaltofen, E., Weispfenning, V.: Computer Algebra Handbook. Springer, Heidelberg (2003)"},{"key":"16_CR7","volume-title":"Modern Computer Algebra","author":"J. von zur Gathen","year":"2003","unstructured":"von zur Gathen, J., Gerhard, J.: Modern Computer Algebra. Cambridge University Press, Cambridge (2003)"},{"key":"16_CR8","series-title":"Encyclopedia of Mathematics and its Applications","volume-title":"Finite Fields","author":"R. Lidl","year":"1997","unstructured":"Lidl, R., Niederreiter, H.: Finite Fields. Encyclopedia of Mathematics and its Applications, vol.\u00a020. Cambridge University Press, Cambridge (1997)"},{"key":"16_CR9","unstructured":"Ehrenfeucht, A., Karpinski, M.: The computational complexity of (XOR, AND)-counting problems. University of Bonn (Technical Report 8543-CS) (1990)"},{"issue":"2","key":"16_CR10","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.tcs.2005.09.011","volume":"348","author":"A. Bulatov","year":"2005","unstructured":"Bulatov, A., Grohe, M.: The complexity of partition functions. Theoretical Computer Science\u00a0348(2), 148\u2013186 (2005)","journal-title":"Theoretical Computer Science"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Cai, J.-Y., Chen, X., Lipton, R., Lu, P.: On tractable exponential sums. arXiv\u00a0(1005.2632) (2010)","DOI":"10.1007\/978-3-642-14553-7_16"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02280291","volume":"18","author":"L. Lov\u00e1sz","year":"1967","unstructured":"Lov\u00e1sz, L.: Operations with structures. Acta Mathematica Hungarica\u00a018, 321\u2013328 (1967)","journal-title":"Acta Mathematica Hungarica"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Dyer, M., Greenhill, C.: The complexity of counting graph homomorphisms. In: Proceedings of the 9th International Conference on Random Structures and Algorithms, pp. 260\u2013289 (2000)","DOI":"10.1002\/1098-2418(200010\/12)17:3\/4<260::AID-RSA5>3.0.CO;2-W"},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1090\/S0894-0347-06-00529-7","volume":"20","author":"M. Freedman","year":"2007","unstructured":"Freedman, M., Lov\u00e1sz, L., Schrijver, A.: Reflection positivity, rank connectivity, and homomorphism of graphs. Journal of the American Mathematical Society\u00a020, 37\u201351 (2007)","journal-title":"Journal of the American Mathematical Society"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Dyer, M., Goldberg, L., Paterson, M.: On counting homomorphisms to directed acyclic graphs. Journal of the ACM\u00a054(6) (2007)","DOI":"10.1145\/1314690.1314691"},{"issue":"3","key":"16_CR16","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"L. Valiant","year":"1979","unstructured":"Valiant, L.: The complexity of enumeration and reliability problems. SIAM Journal on Computing\u00a08(3), 410\u2013421 (1979)","journal-title":"SIAM Journal on Computing"},{"key":"16_CR17","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"L. Valiant","year":"1979","unstructured":"Valiant, L.: The complexity of computing the permanent. Theoretical Computer Science\u00a08, 189\u2013201 (1979)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14553-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T12:30:28Z","timestamp":1559305828000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14553-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642145520","9783642145537"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14553-7_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}