{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T00:09:52Z","timestamp":1758586192800,"version":"3.44.0"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032046994","type":"print"},{"value":"9783032047007","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"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-04700-7_29","type":"book-chapter","created":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T23:45:35Z","timestamp":1758498335000},"page":"391-405","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Saving Energy in\u00a0Boolean Circuits via\u00a0Negations"],"prefix":"10.1007","author":[{"given":"Jayalal","family":"Sarma","sequence":"first","affiliation":[]},{"given":"Kei","family":"Uchizawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,11]]},"reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.tcs.2020.09.003","volume":"845","author":"K Dinesh","year":"2020","unstructured":"Dinesh, K., Otiv, S., Sarma, J.: New bounds for energy complexity of boolean functions. Theoret. Comput. Sci. 845, 59\u201375 (2020)","journal-title":"Theoret. Comput. Sci."},{"key":"29_CR2","first-page":"218","volume":"4","author":"OM Kasim-zade","year":"1992","unstructured":"Kasim-zade, O.M.: On a measure of active circuits of functional elements (Russian). Math. Probl. Cybern. Nauka 4, 218\u2013228 (1992)","journal-title":"Math. Probl. Cybern. Nauka"},{"issue":"4","key":"29_CR3","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1145\/320941.320945","volume":"5","author":"AA Markov","year":"1958","unstructured":"Markov, A.A.: On the inversion complexity of a system of functions. J. ACM 5(4), 331\u2013334 (1958)","journal-title":"J. ACM"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Sarma, J., Uchizawa, K.: Energy and output patterns in Boolean circuits. In: Chen, X.,\u00a0Li, B. (eds.) Theory and Applications of Models of Computation, pp. 185\u2013196. Springer Nature Singapore, Singapore (2024)","DOI":"10.1007\/978-981-97-2340-9_16"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Sherstov, A.A.: On quantum-classical equivalence for composed communication problems. Quantum Info. Comput. 10(5), 435\u2013455 (2010)","DOI":"10.26421\/QIC10.5-6-5"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Sun, X., Sun, Y., Wu, K., Xia, Z.: On the relationship between energy complexity and other Boolean function measures. J. Comb. Optim. 43, 1470\u20131492 (2022)","DOI":"10.1007\/s10878-020-00689-8"},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.tcs.2012.11.039","volume":"505","author":"A Suzuki","year":"2013","unstructured":"Suzuki, A., Uchizawa, K., Zhou, X.: Energy and fan-in of logic circuits computing symmetric Boolean functions. Theoret. Comput. Sci. 505, 74\u201380 (2013)","journal-title":"Theoret. Comput. Sci."},{"issue":"12","key":"29_CR8","doi-asserted-by":"publisher","first-page":"2994","DOI":"10.1162\/neco.2006.18.12.2994","volume":"18","author":"K Uchizawa","year":"2008","unstructured":"Uchizawa, K., Douglas, R.J., Maass, W.: On the computational power of threshold circuits with sparse activity. Neural Comput. 18(12), 2994\u20133008 (2008)","journal-title":"Neural Comput."},{"key":"29_CR9","unstructured":"Uchizawa, K.: Size, depth and energy of threshold circuits computing parity function. In: Proceedings of 31st International Symposium on Algorithms and Computation (ISAAC 2020), vol. 181, pp. 1\u201313 (2020)"},{"key":"29_CR10","unstructured":"Uchizawa, K., Abe, H.: Exponential lower bounds for threshold circuits of sub-linear depth and energy. In: 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023), volume 272 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 1\u201315 (2023)"},{"issue":"1\u20133","key":"29_CR11","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1016\/j.tcs.2008.07.028","volume":"407","author":"K Uchizawa","year":"2008","unstructured":"Uchizawa, K., Takimoto, E.: Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity. Theoret. Comput. Sci. 407(1\u20133), 474\u2013487 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"29_CR12","unstructured":"Vaintsvaig, M.N.: On the power of networks of functional elements (Russian). Doklady Akademii Nauk 139(2), 320\u2013323 (1961)"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-04700-7_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T23:45:38Z","timestamp":1758498338000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-04700-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,11]]},"ISBN":["9783032046994","9783032047007"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-04700-7_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,11]]},"assertion":[{"value":"11 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Fundamentals of Computation Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wroc\u0142aw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","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":"15 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2025","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":"fct2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/fct.ii.uni.wroc.pl","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}