{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:55:59Z","timestamp":1742993759829,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031826962"},{"type":"electronic","value":"9783031826979"}],"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-82697-9_10","type":"book-chapter","created":{"date-parts":[[2025,2,15]],"date-time":"2025-02-15T10:18:07Z","timestamp":1739614687000},"page":"128-141","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Exact Characterizations of\u00a0Non-commutative Algebraic Complexity Without Homogeneity"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2105-9979","authenticated-orcid":false,"given":"Guillaume","family":"Malod","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,16]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","unstructured":"Arvind, V., Joglekar, P.S., Srinivasan, S.: Arithmetic Circuits and the Hadamard Product of Polynomials. In: IARCS Annual Conference on Foundations of Software Technology and heoretical Computer Science, FSTTCS 2009, December 15-17, 2009, IIT Kanpur, India. Ed. by Ravi Kannan and K. Narayan Kumar. Vol. 4. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 2009, pp. 25\u201336. https:\/\/doi.org\/10.4230\/LIPICS.FSTTCS.2009.2304","DOI":"10.4230\/LIPICS.FSTTCS.2009.2304"},{"key":"10_CR2","unstructured":"Barvinok, A.: New Permanent Estimators via Non-Commutative Determinants. ArXiv Mathematics e-prints, July (2000).eprint: math\/0007153"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Baur, W., Strassen, V.: The complexity of partial derivatives. Theor. Comput. Sci.22(3) 317\u2013330 (1983)","DOI":"10.1016\/0304-3975(83)90110-X"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Berstel, J., Reutenauer, C.: Noncommutative Rational Series with Applications. Encyclopedia of Mathematics and its Applications. Cambridge University Press (2011). ISBN: 9780521190220. https:\/\/books.google.fr\/books?id=LL8Nhn72I_8C","DOI":"10.1017\/CBO9780511760860"},{"key":"10_CR5","doi-asserted-by":"publisher","unstructured":"Bj\u00f6rklund, A., et al.: Evaluation of permanents in rings and semirings. In: Inform. Process. Lett. 110(20) 867\u2013870 (2010). issn: 0020-0190. https:\/\/doi.org\/10.1016\/j.ipl.2010.07.005, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020019010002097","DOI":"10.1016\/j.ipl.2010.07.005"},{"key":"10_CR6","doi-asserted-by":"publisher","unstructured":"Bozapalidis, S., Louscou-Bozapalidou, O.: The rank of a formal tree power series. In: Theor. Comput. Sci. 27(1), 211\u2013215 (1983). issn: 0304-3975. https:\/\/doi.org\/10.1016\/0304-3975(83)90100-7, https:\/\/www.sciencedirect.com\/science\/article\/pii\/0304397583901007","DOI":"10.1016\/0304-3975(83)90100-7"},{"key":"10_CR7","doi-asserted-by":"publisher","unstructured":"B\u00fcrgisser, P., et al.: An overview of mathematical issues arising in the geometric complexity theory approach to VP $$\\ne $$ VNP. SIAM J. Comput. 40(4), 1179\u20131209 (Aug 2011) issn: 0097\u20135397. https:\/\/doi.org\/10.1137\/090765328","DOI":"10.1137\/090765328"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Chien, S., Rasmussen, L., Sinclair, A.: Clifford algebras and approximating the permanent. J. Comput. Syst. Sci. 67(2), 263\u2013290 (2003)","DOI":"10.1016\/S0022-0000(03)00010-2"},{"key":"10_CR9","unstructured":"Fijalkow, N., Lagarde, G., Ohlmann, P.: Tight bounds using hankel matrix for arithmetic circuits with unique parse trees. In: Electronic Colloquium Computer Complexity. TR18-038 (2018). ECCC: TR18- 038.https:\/\/eccc.weizmann.ac.il\/report\/2018\/038"},{"key":"10_CR10","doi-asserted-by":"publisher","unstructured":"Fijalkow, N., Lagarde, G., Ohlmann, P., Serre, O.: Lower bounds for arithmetic circuits via the hankel matrix. Comput. Complex. 30(2) (2021). https:\/\/doi.org\/10.1007\/s00037-021-00214-1","DOI":"10.1007\/s00037-021-00214-1"},{"key":"10_CR11","first-page":"197","volume":"53","author":"M Fliess","year":"1974","unstructured":"Fliess, M.: Matrices de Hankel. J. de Math\u00e9matiques Pures et Appliqu\u00e9es 53, 197\u2013222 (1974)","journal-title":"J. de Math\u00e9matiques Pures et Appliqu\u00e9es"},{"key":"10_CR12","doi-asserted-by":"publisher","unstructured":"Fliess, M.: Un codage non commutatif pour certains syst\u00e8mes \u00e9chantillonn\u00e8s non lin\u00e9aires. Inform. Control 38(3), 264\u2013287 (1978). https:\/\/doi.org\/10.1016\/S0019-9958(78)90073-6","DOI":"10.1016\/S0019-9958(78)90073-6"},{"key":"10_CR13","unstructured":"GCT. GCT publications. http:\/\/gct.cs.uchicago.edu\/"},{"issue":"3","key":"10_CR14","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/s00037-011-0007-3","volume":"20","author":"P Hrube\u0161","year":"2011","unstructured":"Hrube\u0161, P., Yehudayoff, A.: Homogeneous formulas and symmetric polynomials. Comput. Complex. 20(3), 559\u2013578 (2011). https:\/\/doi.org\/10.1007\/s00037-011-0007-3","journal-title":"Comput. Complex."},{"key":"10_CR15","unstructured":"Lagarde, G., Malod, G., Perifel, S.: Non-commutative computations: lower bounds and polynomial identity testing. Chic. J. Theor. Comput. Sci. 2019 (2019). http:\/\/cjtcs.cs.uchicago.edu\/articles\/2019\/2\/contents.html"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Nisan, N.: Lower bounds for non-commutative computation (Extended Abstract). In: Proceedings of the 23rd ACM Symposium on Theory of Computing, ACM Press, pp. 410\u2013418 (1991)","DOI":"10.1145\/103418.103462"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Sakarovitch, J., Thomas, R.: Elements of Automata Theory. Cambridge University Press, isbn: 9781139643795 (2009). https:\/\/books.google.fr\/books?id=2RX3AQAAQBAJ","DOI":"10.1017\/CBO9781139195218"},{"key":"10_CR18","unstructured":"Saptharishi, R.: A selection of lower bounds in arithmetic circuit complexity. https:\/\/github.com\/dasarpmar\/lowerbounds-survey\/releases\/latest. Accessed 19 Sept 2024"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Shpilka, A., Wigderson, A.: Depth-3 arithmetic circuits over fields of characteristic zero. Comput. Complex. 10(1) 1\u201327 (2001)","DOI":"10.1007\/PL00001609"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Valiant, L.G.: Completeness classes in algebra. In: STOC \u201979: Proceedings of the eleventh annual ACM symposium on Theory of computing. Atlanta, Georgia, United States: ACM Press, pp. 249\u2013261 (1979)","DOI":"10.1145\/800135.804419"},{"key":"10_CR21","unstructured":"Valiant, L.G.: Reducibility by algebraic projections. In: Logic and Algorithmic: an International Symposium held in honor of Ernst Specker. Vol. 30. Monographies de l\u2019Enseignement Math\u00e9mathique, pp. 365\u2013380 (1982)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2025: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-82697-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,15]],"date-time":"2025-02-15T10:18:14Z","timestamp":1739614694000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-82697-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031826962","9783031826979"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-82697-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"16 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bratislava","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","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":"21 January 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 January 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"50","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.sofsem.sk","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}