{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:51:54Z","timestamp":1743137514481,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030261757"},{"type":"electronic","value":"9783030261764"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-26176-4_8","type":"book-chapter","created":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T23:02:56Z","timestamp":1563922976000},"page":"90-102","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes"],"prefix":"10.1007","author":[{"given":"Prasad","family":"Chaugule","sequence":"first","affiliation":[]},{"given":"Nutan","family":"Limaye","sequence":"additional","affiliation":[]},{"given":"Aditya","family":"Varre","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,21]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Valiant, L.G.: Completeness classes in algebra. In: Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing, STOC 1979, pp. 249\u2013261 (1979)","DOI":"10.1145\/800135.804419"},{"key":"8_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04179-6","volume-title":"Completeness and Reduction in Algebraic Complexity Theory","author":"P B\u00fcrgisser","year":"2013","unstructured":"B\u00fcrgisser, P.: Completeness and Reduction in Algebraic Complexity Theory, vol. 7. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-662-04179-6"},{"issue":"1","key":"8_CR3","doi-asserted-by":"publisher","first-page":"135","DOI":"10.4086\/toc.2010.v006a007","volume":"6","author":"R Raz","year":"2010","unstructured":"Raz, R.: Elusive functions and lower bounds for arithmetic circuits. Theory Comput. 6(1), 135\u2013177 (2010)","journal-title":"Theory Comput."},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/978-3-642-22006-7_59","volume-title":"Automata, Languages and Programming","author":"S Mengel","year":"2011","unstructured":"Mengel, S.: Characterizing arithmetic circuit classes by constraint satisfaction problems. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6755, pp. 700\u2013711. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22006-7_59"},{"issue":"4","key":"8_CR5","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/s00224-015-9630-8","volume":"58","author":"F Capelli","year":"2016","unstructured":"Capelli, F., Durand, A., Mengel, S.: The arithmetic complexity of tensor contraction. Theory Comput. Syst. 58(4), 506\u2013527 (2016)","journal-title":"Theory Comput. Syst."},{"key":"8_CR6","unstructured":"Durand, A., Mahajan, M., Malod, G., de Rugy-Altherre, N., Saurabh, N.: Homomorphism polynomials complete for VP. In: LIPIcs-Leibniz International Proceedings in Informatics, vol. 29 (2014)"},{"key":"8_CR7","first-page":"151","volume":"71","author":"SA Cook","year":"1971","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. STOC 71, 151\u2013158 (1971)","journal-title":"STOC"},{"issue":"3","key":"8_CR8","first-page":"115","volume":"9","author":"LA Levin","year":"1973","unstructured":"Levin, L.A.: Universal search problems. Probl. Inf. Transm. 9(3), 115\u2013116 (1973). (in Russian)","journal-title":"Probl. Inf. Transm."},{"key":"8_CR9","unstructured":"Greenlaw, R., Hoover, H.J., Ruzzo, W.: A compendium of problems complete for P, vol. 11 (1992)"},{"issue":"3","key":"8_CR10","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1007\/s00224-016-9740-y","volume":"62","author":"M Mahajan","year":"2018","unstructured":"Mahajan, M., Saurabh, N.: Some complete and intermediate polynomials in algebraic complexity theory. Theory Comput. Syst. 62(3), 622\u2013652 (2018)","journal-title":"Theory Comput. Syst."},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-642-32589-2_29","volume-title":"Mathematical Foundations of Computer Science 2012","author":"N Rugy-Altherre","year":"2012","unstructured":"Rugy-Altherre, N.: A Dichotomy theorem for homomorphism polynomials. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 308\u2013322. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32589-2_29"},{"issue":"1","key":"8_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.7155\/jgaa.00382","volume":"20","author":"C Engels","year":"2016","unstructured":"Engels, C.: Dichotomy theorems for homomorphism polynomials of graph classes. J. Graph Algorithms Appl. 20(1), 3\u201322 (2016)","journal-title":"J. Graph Algorithms Appl."},{"key":"8_CR13","unstructured":"Saurabh, N.: Analysis of algebraic complexity classes and boolean functions. Ph.D. thesis (2017)"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1007\/11821069_61","volume-title":"Mathematical Foundations of Computer Science 2006","author":"G Malod","year":"2006","unstructured":"Malod, G., Portier, N.: Characterizing Valiant\u2019s algebraic complexity classes. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 704\u2013716. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11821069_61"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Chaugule, P., Limaye, N., Varre, A.: Variants of homomorphism polynomials complete for algebraic complexity classes, 31 July 2018","DOI":"10.1007\/978-3-030-26176-4_8"},{"issue":"3-4","key":"8_CR16","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1561\/0400000039","volume":"5","author":"Amir Shpilka","year":"2009","unstructured":"Shpilka, A., Yehudayoff, A., et al.: Arithmetic circuits: a survey of recent results and open questions. Found. Trends\u00ae Theor. Comput. Sci. 5(3\u20134), 207\u2013388 (2010)","journal-title":"Foundations and Trends\u00ae in Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-26176-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:05:25Z","timestamp":1709820325000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-26176-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030261757","9783030261764"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-26176-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"21 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xi'an","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ictt.xidian.edu.cn\/COCOON2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}