{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T06:04:16Z","timestamp":1784354656928,"version":"3.55.0"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032323347","type":"print"},{"value":"9783032323354","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T00:00:00Z","timestamp":1784419200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T00:00:00Z","timestamp":1784419200000},"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":[[2027]]},"DOI":"10.1007\/978-3-032-32335-4_16","type":"book-chapter","created":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T05:30:10Z","timestamp":1784352610000},"page":"214-220","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Comparison of\u00a0the\u00a0Runtime of\u00a0Two Algorithms for\u00a0the\u00a0Linear Decomposition of\u00a0ReLU Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-0560-4764","authenticated-orcid":false,"given":"Arn","family":"Dietz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6006-6325","authenticated-orcid":false,"given":"Simon","family":"Lutz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1996-5307","authenticated-orcid":false,"given":"Martin","family":"Brenzke","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1882-2005","authenticated-orcid":false,"given":"Thea","family":"Rad\u00fcntz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5409-6875","authenticated-orcid":false,"given":"Emmanuel","family":"M\u00fcller","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,19]]},"reference":[{"key":"16_CR1","unstructured":"Berzins, A.: Polyhedral complex extraction from relu networks using edge subdivision. In: International Conference on Machine Learning, pp. 2234\u20132244. PMLR (2023)"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Botoeva, E., Kouvaros, P., Kronqvist, J., Lomuscio, A., Misener, R.: Efficient verification of relu-based neural networks via dependency analysis. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, no. (04), pp. 3291\u20133299 (2020)","DOI":"10.1609\/aaai.v34i04.5729"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Ferlez, J., Shoukry, Y.: Bounding the complexity of formally verifying neural networks: a geometric approach. In: 2021 60th IEEE Conference on Decision and Control (CDC), pp. 5104\u20135109. IEEE (2021)","DOI":"10.1109\/CDC45484.2021.9683375"},{"key":"16_CR4","unstructured":"Hanin, B., Rolnick, D.: Deep relu networks have surprisingly few activation patterns. Adv. Neural. Inf. Process. Syst. 32 (2019)"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Humayun, A.I., Balestriero, R., Balakrishnan, G., Baraniuk, R.G.: Splinecam: Exact visualization and characterization of deep network geometry and decision boundaries. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 3789\u20133798 (2023)","DOI":"10.1109\/CVPR52729.2023.00369"},{"key":"16_CR6","unstructured":"Kaulen, K., et al.: The 6th international verification of neural networks competition (vnn-comp 2025): Summary and results (2025). https:\/\/arxiv.org\/abs\/2512.19007"},{"key":"16_CR7","unstructured":"Paszke, A., et al.: Automatic differentiation in pytorch (2017)"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Vincent, J.A., Schwager, M.: Reachable polyhedral marching (rpm): A safety verification algorithm for robotic systems with deep neural network components. In: 2021 IEEE International Conference on Robotics and Automation (ICRA), pp. 9029\u20139035. IEEE (2021)","DOI":"10.1109\/ICRA48506.2021.9561956"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Wang, Y.: Estimation and comparison of linear regions for relu networks. In: IJCAI. pp. 3544\u20133550 (2022)","DOI":"10.24963\/ijcai.2022\/492"},{"key":"16_CR10","unstructured":"Xu, S., Vaughan, J., Chen, J., Zhang, A., Sudjianto, A.: Traversing the local polytopes of relu neural networks: A unified approach for network verification (2021). arXiv preprint arXiv:2111.08922"}],"container-title":["Lecture Notes in Computer Science","KI 2026: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-32335-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T05:30:12Z","timestamp":1784352612000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-32335-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,19]]},"ISBN":["9783032323347","9783032323354"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-32335-4_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,19]]},"assertion":[{"value":"19 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"KI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"German Conference on Artificial Intelligence (K\u00fcnstliche Intelligenz)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bremen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"11 August 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 August 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"49","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ki2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ki2026.gi.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}