{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:45:36Z","timestamp":1770972336549,"version":"3.50.1"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031929311","type":"print"},{"value":"9783031929328","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-92932-8_7","type":"book-chapter","created":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T07:47:13Z","timestamp":1747468033000},"page":"91-104","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Branching Programs with\u00a0Extended Memory: New Insights"],"prefix":"10.1007","author":[{"given":"Suryajith","family":"Chillara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nithish","family":"Raja","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,18]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Cleve, R.: Computing algebraic formulas using a constant number of registers. SIAM J. Comput. 21(1), 54\u201358 (1992)","DOI":"10.1137\/0221006"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"B\u00fcrgisser, P.: Completeness and Reduction in Algebraic Complexity Theory, Algorithms and computation in mathematics, vol.\u00a07. Springer, Heidelberg (2000)","DOI":"10.1007\/978-3-662-04179-6"},{"key":"7_CR3","doi-asserted-by":"publisher","unstructured":"Chatterjee, P., Gajjar, K., Tengse, A.: Monotone classes beyond VNP. In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0284. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2023). https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2023.11. https:\/\/drops.dagstuhl.de\/entities\/document\/10.4230\/LIPIcs.FSTTCS.2023.11","DOI":"10.4230\/LIPIcs.FSTTCS.2023.11"},{"key":"7_CR4","unstructured":"Chillara, S., Raja, N.: Branching Programs with Extended Memory: New Insights (2024). https:\/\/hal.science\/hal-04737571"},{"issue":"1","key":"7_CR5","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.jco.2006.09.006","volume":"24","author":"G Malod","year":"2008","unstructured":"Malod, G., Portier, N.: Characterizing valiant\u2019s algebraic complexity classes. J. Complex. 24(1), 16\u201338 (2008)","journal-title":"J. Complex."},{"key":"7_CR6","doi-asserted-by":"publisher","unstructured":"Mengel, S.: Arithmetic branching programs with memory. In: Mathematical foundations of computer science 2013, Lecture Notes in Computer Science, vol.\u00a08087, pp. 667\u2013678. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40313-259","DOI":"10.1007\/978-3-642-40313-259"},{"key":"7_CR7","unstructured":"Saptharishi, R.: A survey of lower bounds in arithmetic circuit complexity, version 9.0.3 (2021). https:\/\/github.com\/dasarpmar\/lowerbounds-survey\/releases\/tag\/v9.0.3"},{"key":"7_CR8","doi-asserted-by":"publisher","unstructured":"Shpilka, A., Yehudayoff, A.: Arithmetic circuits: a survey of recent results and open questions. Found. Trends Theor. Comput. Sci. 5(3-4), 207\u2013388 (2010). https:\/\/doi.org\/10.1561\/0400000039","DOI":"10.1561\/0400000039"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Valiant, L.G.: Completeness classes in algebra. In: Conference Record of the Eleventh Annual ACM Symposium on Theory of Computing (Atlanta, Ga., 1979), pp. 249\u2013261. ACM, New York (1979)","DOI":"10.1145\/800135.804419"},{"key":"7_CR10","unstructured":"Valiant, L.G.: Reducibility by algebraic projections. Enseign. Math. (2) 28(3-4), 253\u2013268 (1982)"},{"issue":"4","key":"7_CR11","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1137\/0212043","volume":"12","author":"LG Valiant","year":"1983","unstructured":"Valiant, L.G., Skyum, S., Berkowitz, S., Rackoff, C.: Fast parallel computation of polynomials using few processors. SIAM J. Comput. 12(4), 641\u2013644 (1983)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-92932-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T08:03:43Z","timestamp":1747469023000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-92932-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031929311","9783031929328"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-92932-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"18 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/easyconferences.eu\/ciac2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}