{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T11:54:00Z","timestamp":1781610840545,"version":"3.54.5"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T00:00:00Z","timestamp":1781568000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T00:00:00Z","timestamp":1781568000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP22K11897"],"award-info":[{"award-number":["JP22K11897"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1007\/s00236-026-00539-w","type":"journal-article","created":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T11:17:48Z","timestamp":1781608668000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Upper bound for output patterns of energy-bounded boolean circuits, and its applications"],"prefix":"10.1007","volume":"63","author":[{"given":"Jayalal","family":"Sarma","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kei","family":"Uchizawa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,16]]},"reference":[{"key":"539_CR1","unstructured":"Choudhury, T., Sreenivasaiah, K.: Depth-3 Circuit Lower Bounds for k-OV. In: 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024, vol. 289, pp. 25\u201312517. (2024) . (Leibniz International Proceedings in Informatics (LIPIcs))"},{"key":"539_CR2","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."},{"issue":"4","key":"539_CR3","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1016\/S0022-0000(02)00019-3.","volume":"65","author":"J Forster","year":"2002","unstructured":"Forster, J.: A linear lower bound on the unbounded error probabilistic communication complexity. J. Comput. Syst. Sci. 65(4), 612\u2013625 (2002). https:\/\/doi.org\/10.1016\/S0022-0000(02)00019-3. (Special Issue on Complexity 2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"539_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24508-4","volume-title":"Boolean Function Complexity: Advances and Frontiers","author":"S Jukna","year":"2012","unstructured":"Jukna, S.: Boolean Function Complexity: Advances and Frontiers. Springer, Berlin, Heidelberg (2012)"},{"key":"539_CR5","unstructured":"Kasim-zade, O.M.: On a measure of active circuits of functional elements (russian). Mathematical problems in cybernetics \u201cNauka\u201d (4), 218\u2013228 (1992)"},{"issue":"4","key":"539_CR6","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1134\/S1995080215040277","volume":"36","author":"SA Lozhkin","year":"2015","unstructured":"Lozhkin, S.A., Shupletsov, M.S.: Switching activity of Boolean circuits and synthesis of Boolean circuits with asymptotically optimal complexity and linear switching activity. Lobachevskii J. Math. 36(4), 450\u2013460 (2015). https:\/\/doi.org\/10.1134\/S1995080215040277","journal-title":"Lobachevskii J. Math."},{"key":"539_CR7","doi-asserted-by":"crossref","unstructured":"Maniwa, H., Oki, T., Suzuki, A., Uchizawa, K., Zhou, X.: Computational power of threshold circuits of energy at most two. IEICE Transactions on Fundamentals of Electronics (9), 1431\u20131439 (2018). (Communications and Computer Sciences E101.A)","DOI":"10.1587\/transfun.E101.A.1431"},{"key":"539_CR8","unstructured":"Minsky, M., Papert, S.: Perceptrons: An Introduction to Computational Geometry. MIT Press, Massachusetts Institute of Technology, Canbeidge, Massachusetts 02142 (1988)"},{"key":"539_CR9","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1836.001.0001","volume-title":"Circuit Complexity and Neural Networks","author":"I Parberry","year":"1994","unstructured":"Parberry, I.: Circuit Complexity and Neural Networks. MIT Press, Cambridge, Massachusetts, London, England (1994)"},{"key":"539_CR10","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-981-97-2340-9_16","volume-title":"Theory and Applications of Models of Computation","author":"J Sarma","year":"2024","unstructured":"Sarma, J., Uchizawa, K.: Energy and output patterns in Boolean circuits. In: Chen, X., Li, B. (eds.) Theory and Applications of Models of Computation, pp. 185\u2013196. Springer, Singapore (2024)"},{"key":"539_CR11","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.tcs.2022.08.005","volume":"932","author":"JCN Silva","year":"2022","unstructured":"Silva, J.C.N., Souza, U.S.: Computing the best-case energy complexity of satisfying assignments in monotone circuits. Theoret. Comput. Sci. 932, 41\u201355 (2022)","journal-title":"Theoret. Comput. Sci."},{"key":"539_CR12","doi-asserted-by":"publisher","first-page":"1470","DOI":"10.1007\/s10878-020-00689-8","volume":"43","author":"X Sun","year":"2022","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)","journal-title":"J. Comb. Optim."},{"key":"539_CR13","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."},{"key":"539_CR14","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. 54\u201315413. (2020)"},{"issue":"1\u20133","key":"539_CR15","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."},{"issue":"12","key":"539_CR16","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":"539_CR17","unstructured":"Uchizawa, K., Wang, Z., Morizumi, H., Zhou, X.: Complexity of Counting Output Patterns of Logic Circuits. In: Proceedings of the Nineteenth Computing: The Australasian Theory Symposium - Volume 141, pp. 37\u201341 (2013)"},{"issue":"2","key":"539_CR18","first-page":"320","volume":"139","author":"MN Vaintsvaig","year":"1961","unstructured":"Vaintsvaig, M.N.: On the power of networks of functional elements (Russian). Dokl. Akad. Nauk SSSR 139(2), 320\u2013323 (1961)","journal-title":"Dokl. Akad. Nauk SSSR"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-026-00539-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00236-026-00539-w","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-026-00539-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T11:17:56Z","timestamp":1781608676000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00236-026-00539-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,16]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,9]]}},"alternative-id":["539"],"URL":"https:\/\/doi.org\/10.1007\/s00236-026-00539-w","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,16]]},"assertion":[{"value":"31 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 May 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 June 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"21"}}