{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:57:35Z","timestamp":1781305055210,"version":"3.54.1"},"publisher-location":"Cham","reference-count":49,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032286901","type":"print"},{"value":"9783032286918","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-28691-8_26","type":"book-chapter","created":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:34:00Z","timestamp":1781303640000},"page":"394-409","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Arithmetic Circuits and\u00a0Neural Networks for\u00a0Regular Matroids"],"prefix":"10.1007","author":[{"given":"Christoph","family":"Hertrich","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"Kober","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Georg","family":"Loho","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,13]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Anari, N., Gharan, S.O., Vinzant, C.: Log-concave polynomials, entropy, and a deterministic approximation algorithm for counting bases of matroids. In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 35\u201346. IEEE (2018)","DOI":"10.1109\/FOCS.2018.00013"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Anari, N., Liu, K., Gharan, S.O., Vinzant, C.: Log-concave polynomials II: high-dimensional walks and an FPRAS for counting bases of a matroid. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pp. 1\u201312 (2019)","DOI":"10.1145\/3313276.3316385"},{"issue":"1","key":"26_CR3","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1287\/moor.2021.1137","volume":"47","author":"M Aprile","year":"2022","unstructured":"Aprile, M., Fiorini, S.: Regular matroids have polynomial extension complexity. Math. Oper. Res. 47(1), 540\u2013559 (2022)","journal-title":"Math. Oper. Res."},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Aprile, M., et al.: Integer programs with nearly totally unimodular matrices: the cographic case. In: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2301\u20132312. SIAM (2025)","DOI":"10.1137\/1.9781611978322.76"},{"key":"26_CR5","unstructured":"Arora, R., Basu, A., Mianjy, P., Mukherjee, A.: Understanding deep neural networks with rectified linear units. In: International Conference on Learning Representations (2018)"},{"key":"26_CR6","unstructured":"Artmann, S.: Optimization of bimodular integer programs and feasibility for three-modular base block IPs. Ph.D. thesis, ETH Zurich (2020)"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Artmann, S., Weismantel, R., Zenklusen, R.: A strongly polynomial algorithm for bimodular integer linear programming. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pp. 1206\u20131219 (2017)","DOI":"10.1145\/3055399.3055473"},{"key":"26_CR8","unstructured":"Averkov, G., Hojny, C., Merkert, M.: On the expressiveness of rational ReLU neural networks with bounded depth. In: The Thirteenth Internatinal Conference on Learning Representations (2025)"},{"key":"26_CR9","unstructured":"Bakaev, E., Brunck, F., Hertrich, C., Reichman, D., Yehudayoff, A.: On the depth of monotone ReLU neural networks and ICNNs. arXiv preprint arXiv:2505.06169 (2025)"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Bakaev, E., Brunck, F., Hertrich, C., Stade, J., Yehudayoff, A.: Better neural network expressivity: subdividing the simplex. arXiv preprint arXiv:2505.14338 (2025)","DOI":"10.1145\/3798129.3800768"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"B\u00e9rczi, K., M\u00e1trav\u00f6lgyi, B., Schwarcz, T.: Reconfiguration of basis pairs in regular matroids. In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing, pp. 1653\u20131664 (2024)","DOI":"10.1145\/3618260.3649660"},{"key":"26_CR12","unstructured":"Brandenburg, M.C., Grillo, M., Hertrich, C.: Decomposition polyhedra of piecewise linear functions. In: The Thirteenth International Conference on Learning Representations (2025)"},{"key":"26_CR13","unstructured":"Camion, P.: Matrices totalement unimodulaires et problemes combinatoires. Ph.D. thesis, Universit\u00e9 Libre de Bruxelles (1964)"},{"key":"26_CR14","unstructured":"Charisopoulos, V., Maragos, P.: A tropical approach to neural networks with piecewise linear activations. arXiv preprint arXiv:1805.08749 (2018)"},{"issue":"4","key":"26_CR15","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF02551274","volume":"2","author":"G Cybenko","year":"1989","unstructured":"Cybenko, G.: Approximation by superpositions of a sigmoidal function. Math. Control Signals Syst. 2(4), 303\u2013314 (1989)","journal-title":"Math. Control Signals Syst."},{"issue":"5","key":"26_CR16","doi-asserted-by":"publisher","first-page":"1807","DOI":"10.1137\/13094030X","volume":"43","author":"M Dinitz","year":"2014","unstructured":"Dinitz, M., Kortsarz, G.: Matroid secretary for regular and decomposable matroids. SIAM J. Comput. 43(5), 1807\u20131830 (2014)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"26_CR17","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s10107-020-01542-w","volume":"190","author":"S Fiorini","year":"2021","unstructured":"Fiorini, S., Huynh, T., Weltge, S.: Strengthening convex relaxations of 0\/1-sets using Boolean formulas. Math. Program. 190(1), 467\u2013482 (2021)","journal-title":"Math. Program."},{"key":"26_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10208-014-9231-y","volume":"16","author":"S Fomin","year":"2016","unstructured":"Fomin, S., Grigoriev, D., Koshevoy, G.: Subtraction-free complexity, cluster transformations, and spanning trees. Found. Comput. Math. 16, 1\u201331 (2016)","journal-title":"Found. Comput. Math."},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"Gagneux, A., Massias, M., Soubies, E., Gribonval, R.: Convexity in ReLU neural networks: beyond ICNNs? arXiv preprint arXiv:2501.03017 (2025)","DOI":"10.1007\/s10851-025-01253-x"},{"issue":"1","key":"26_CR20","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s00026-015-0251-3","volume":"19","author":"J Geelen","year":"2015","unstructured":"Geelen, J., Gerards, B., Whittle, G.: The highly connected matroids in minor-closed classes. Ann. Comb. 19(1), 107\u2013123 (2015)","journal-title":"Ann. Comb."},{"key":"26_CR21","unstructured":"Grillo, M., Hertrich, C., Loho, G.: Depth-bounds for neural networks via the braid arrangement. In: Conference on Neural Information Processing Systems (NeurIPS) (2025)"},{"key":"26_CR22","doi-asserted-by":"crossref","unstructured":"Haase, C.A., Hertrich, C., Loho, G.: Lower bounds on the depth of integral ReLU neural networks via lattice polytopes. In: The Eleventh International Conference on Learning Representations (2023)","DOI":"10.1137\/22M1489332"},{"issue":"2","key":"26_CR23","doi-asserted-by":"publisher","first-page":"997","DOI":"10.1137\/22M1489332","volume":"37","author":"C Hertrich","year":"2023","unstructured":"Hertrich, C., Basu, A., Di Summa, M., Skutella, M.: Towards lower bounds on the depth of ReLU neural networks. SIAM J. Discret. Math. 37(2), 997\u20131029 (2023)","journal-title":"SIAM J. Discret. Math."},{"key":"26_CR24","unstructured":"Hertrich, C., Kober, S., Loho, G.: Arithmetic circuits and neural networks for regular matroids. arXiv preprint arXiv:2511.02406 (2025)"},{"key":"26_CR25","unstructured":"Hertrich, C., Loho, G.: Neural networks and (virtual) extended formulations. arXiv preprint arXiv:2411.03006 (2024)"},{"key":"26_CR26","doi-asserted-by":"crossref","unstructured":"Hertrich, C., Sering, L.: ReLU neural networks of polynomial size for exact maximum flow computation. Math. Program. 1\u201330 (2024)","DOI":"10.1007\/s10107-024-02096-x"},{"issue":"5","key":"26_CR27","doi-asserted-by":"publisher","first-page":"1079","DOI":"10.1287\/ijoc.2021.0225","volume":"35","author":"C Hertrich","year":"2023","unstructured":"Hertrich, C., Skutella, M.: Provably good solutions to the knapsack problem via neural networks of bounded size. INFORMS J. Comput. 35(5), 1079\u20131097 (2023)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"26_CR28","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s11856-023-2510-z","volume":"256","author":"P Hrube\u0161","year":"2023","unstructured":"Hrube\u0161, P., Yehudayoff, A.: Shadows of newton polytopes. Israel J. Math. 256(1), 311\u2013343 (2023)","journal-title":"Israel J. Math."},{"key":"26_CR29","unstructured":"Huchette, J., Mu\u00f1oz, G., Serra, T., Tsay, C.: When deep learning meets polyhedral theory: a survey. arXiv preprint arXiv:2305.00241 (2023)"},{"issue":"3","key":"26_CR30","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1145\/322326.322341","volume":"29","author":"M Jerrum","year":"1982","unstructured":"Jerrum, M., Snir, M.: Some exact complexity results for straight-line computations over semirings. J. ACM (JACM) 29(3), 874\u2013897 (1982)","journal-title":"J. ACM (JACM)"},{"key":"26_CR31","doi-asserted-by":"crossref","unstructured":"Joswig, M.: Essentials of tropical combinatorics, vol.\u00a0219. American Mathematical Society (2021)","DOI":"10.1090\/gsm\/219"},{"issue":"1","key":"26_CR32","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/s00224-014-9574-4","volume":"57","author":"S Jukna","year":"2015","unstructured":"Jukna, S.: Lower bounds for tropical circuits and dynamic programs. Theory Comput. Syst. 57(1), 160\u2013194 (2015)","journal-title":"Theory Comput. Syst."},{"key":"26_CR33","doi-asserted-by":"crossref","unstructured":"Jukna, S.: Tropical Circuit Complexity: Limits of Pure Dynamic Programming. Springer, Heidelberg (2023)","DOI":"10.1007\/978-3-031-42354-3"},{"key":"26_CR34","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.ipl.2018.10.018","volume":"142","author":"S Jukna","year":"2019","unstructured":"Jukna, S., Seiwert, H.: Greedy can beat pure dynamic programming. Inf. Process. Lett. 142, 90\u201395 (2019)","journal-title":"Inf. Process. Lett."},{"issue":"12","key":"26_CR35","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1002\/andp.18471481202","volume":"148","author":"G Kirchhoff","year":"1847","unstructured":"Kirchhoff, G.: Ueber die Aufl\u00f6sung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Str\u00f6me gef\u00fchrt wird. Ann. Phys. 148(12), 497\u2013508 (1847)","journal-title":"Ann. Phys."},{"key":"26_CR36","doi-asserted-by":"crossref","unstructured":"Knapp, C., Noble, S.: The complexity of the greedoid tutte polynomial. Electron. J. Comb. 32(3), #P3.3 (2025)","DOI":"10.37236\/11718"},{"issue":"6","key":"26_CR37","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1016\/S0893-6080(05)80131-5","volume":"6","author":"M Leshno","year":"1993","unstructured":"Leshno, M., Lin, V.Y., Pinkus, A., Schocken, S.: Multilayer feedforward networks with a nonpolynomial activation function can approximate any function. Neural Netw. 6(6), 861\u2013867 (1993)","journal-title":"Neural Netw."},{"issue":"1","key":"26_CR38","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1137\/0130017","volume":"30","author":"SB Maurer","year":"1976","unstructured":"Maurer, S.B.: Matrix generalizations of some theorems on trees, cycles and cocycles in graphs. SIAM J. Appl. Math. 30(1), 143\u2013148 (1976)","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"26_CR39","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1007\/s10107-024-02148-2","volume":"210","author":"M N\u00e4gele","year":"2025","unstructured":"N\u00e4gele, M., N\u00f6bel, C., Santiago, R., Zenklusen, R.: Advances on strictly $$\\Delta $$-modular IPs. Math. Program. 210(1), 731\u2013760 (2025)","journal-title":"Math. Program."},{"key":"26_CR40","volume-title":"Matroid theory","author":"JG Oxley","year":"2006","unstructured":"Oxley, J.G.: Matroid theory, vol. 3. Oxford University Press, Oxford (2006)"},{"issue":"2\u20133","key":"26_CR41","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0095-8956(77)90031-4","volume":"23","author":"PD Seymour","year":"1977","unstructured":"Seymour, P.D.: The matroids with the max-flow min-cut property. J. Comb. Theory, Ser. B 23(2\u20133), 189\u2013222 (1977)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"3","key":"26_CR42","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0095-8956(80)90075-1","volume":"28","author":"PD Seymour","year":"1980","unstructured":"Seymour, P.D.: Decomposition of regular matroids. J. Comb. Theory, Ser. B 28(3), 305\u2013359 (1980)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"1","key":"26_CR43","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF02579179","volume":"1","author":"PD Seymour","year":"1981","unstructured":"Seymour, P.D.: Recognizing graphic matroids. Combinatorica 1(1), 75\u201378 (1981)","journal-title":"Combinatorica"},{"key":"26_CR44","doi-asserted-by":"crossref","unstructured":"Shpilka, A., Yehudayoff, A.: Arithmetic circuits: a survey of recent results and open questions. Found. Trends\u00ae Theor. Comput. Sci. 5(3\u20134), 207\u2013388 (2010)","DOI":"10.1561\/0400000039"},{"key":"26_CR45","doi-asserted-by":"crossref","unstructured":"Snook, M.: Counting bases of representable matroids. Electron. J. Comb. P41\u2013P41 (2012)","DOI":"10.37236\/2396"},{"key":"26_CR46","unstructured":"Truemper, K.: Matroid decomposition, vol. 6, Citeseer (1992)"},{"key":"26_CR47","unstructured":"Valerdi, J.L.: On minimal depth in neural networks. arXiv preprint arXiv:2402.15315 (2024)"},{"key":"26_CR48","doi-asserted-by":"crossref","unstructured":"Valiant, L.G.: Negation can be exponentially powerful. In: Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing, pp. 189\u2013196 (1979)","DOI":"10.1145\/800135.804412"},{"key":"26_CR49","unstructured":"Zhang, L., Naitzat, G., Lim, L.H.: Tropical geometry of deep neural networks. In: International Conference on Machine Learning, pp. 5824\u20135832. PMLR (2018)"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-28691-8_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:34:08Z","timestamp":1781303648000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-28691-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032286901","9783032286918"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-28691-8_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"13 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Padua","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/events.math.unipd.it\/ipco2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}