{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T23:04:10Z","timestamp":1781651050607,"version":"3.54.5"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2021,1,7]],"date-time":"2021-01-07T00:00:00Z","timestamp":1609977600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,7]],"date-time":"2021-01-07T00:00:00Z","timestamp":1609977600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61433014, 61832003, 61761136014, 61872334, 61502449, 61602440"],"award-info":[{"award-number":["61433014, 61832003, 61761136014, 61872334, 61502449, 61602440"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China","doi-asserted-by":"publisher","award":["2016YFB1000201"],"award-info":[{"award-number":["2016YFB1000201"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012692","name":"K. C. Wong Education Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012692","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s10878-020-00689-8","type":"journal-article","created":{"date-parts":[[2021,1,7]],"date-time":"2021-01-07T21:03:26Z","timestamp":1610053406000},"page":"1470-1492","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On the relationship between energy complexity and other boolean function measures"],"prefix":"10.1007","volume":"43","author":[{"given":"Xiaoming","family":"Sun","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2012-2019","authenticated-orcid":false,"given":"Yuan","family":"Sun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kewen","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhiyu","family":"Xia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,1,7]]},"reference":[{"key":"689_CR1","doi-asserted-by":"crossref","unstructured":"Aaronson S, Ben-David S, Kothari R, Rao S, Tal A (2020) Degree vs. approximate degree and quantum implications of huang\u2019s sensitivity theorem","DOI":"10.1145\/3406325.3451047"},{"key":"689_CR2","doi-asserted-by":"crossref","unstructured":"Amano K, Maruoka A (2005) On the complexity of depth-2 circuits with threshold gates. In: international symposium on mathematical foundations of computer science, Springer, Berlin, 107\u2013118","DOI":"10.1007\/11549345_11"},{"key":"689_CR3","doi-asserted-by":"crossref","unstructured":"Antoniadis A, Barcelo N, Nugent M, Pruhs K, Scquizzato M (2014) Energy-efficient circuit design. In: Proceedings of the 5th conference on Innovations in theoretical computer science, ACM 303\u2013312","DOI":"10.1145\/2554797.2554826"},{"key":"689_CR4","doi-asserted-by":"crossref","unstructured":"Barcelo N, Nugent M, Pruhs K, Scquizzato M (2015) Almost all functions require exponential energy. In: international symposium on mathematical foundations of computer science, Springer 90\u2013101","DOI":"10.1007\/978-3-662-48054-0_8"},{"issue":"1","key":"689_CR5","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0304-3975(01)00144-X","volume":"288","author":"H Buhrman","year":"2002","unstructured":"Buhrman H, De Wolf R (2002) Complexity measures and decision tree complexity: a survey. Theoret Comput Sci 288(1):21\u201343","journal-title":"Theoret Comput Sci"},{"key":"689_CR6","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 (2020) New bounds for energy complexity of boolean functions. Theoret Comput Sci 845:59\u201375","journal-title":"Theoret Comput Sci"},{"key":"689_CR7","doi-asserted-by":"crossref","unstructured":"Dinesh K, Otiv S, Sarma J (2018) New bounds for energy complexity of boolean functions. In: International computing and combinatorics conference, Springer, Berlin, 738\u2013750","DOI":"10.1007\/978-3-319-94776-1_61"},{"key":"689_CR8","volume-title":"Theory of computational complexity","author":"DZ Du","year":"2001","unstructured":"Du DZ, Ko KI (2001) Theory of computational complexity. Wiley, New York"},{"key":"689_CR9","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.tcs.2012.11.006","volume":"468","author":"Y Gao","year":"2013","unstructured":"Gao Y, Mao J, Sun X, Zuo S (2013) On the sensitivity complexity of bipartite graph properties. Theoret Comput Sci 468:83\u201391","journal-title":"Theoret Comput Sci"},{"issue":"2","key":"689_CR10","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0022-0000(93)90001-D","volume":"46","author":"A Hajnal","year":"1993","unstructured":"Hajnal A, Maass W, Pudl\u00e1k P, Szegedy M, Tur\u00e1n G (1993) Threshold circuits of bounded depth. J Comput Syst Sci 46(2):129\u2013154","journal-title":"J Comput Syst Sci"},{"issue":"2","key":"689_CR11","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF01272517","volume":"1","author":"J H\u00e5stad","year":"1991","unstructured":"H\u00e5stad J, Goldmann M (1991) On the power of small-depth threshold circuits. Comput Complex 1(2):113\u2013129","journal-title":"Comput Complex"},{"key":"689_CR12","unstructured":"Hatami P, Kulkarni R, Pankratov D (2010) Variations on the sensitivity conjecture. arXiv preprint arXiv:1011.0354"},{"key":"689_CR13","doi-asserted-by":"crossref","unstructured":"Huang H (2019) Induced subgraphs of hypercubes and a proof of the sensitivity conjecture","DOI":"10.4007\/annals.2019.190.3.6"},{"issue":"4","key":"689_CR14","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/BF02579140","volume":"4","author":"J Kahn","year":"1984","unstructured":"Kahn J, Saks M, Sturtevant D (1984) A topological approach to evasiveness. Combinatorica 4(4):297\u2013306","journal-title":"Combinatorica"},{"key":"689_CR15","unstructured":"Karpas I (2016) Lower bounds for sensitivity of graph properties. arXiv preprint arXiv:1609.05320"},{"key":"689_CR16","first-page":"218","volume":"4","author":"OM Kasim-Zade","year":"1992","unstructured":"Kasim-Zade OM (1992) On a measure of active circuits of functional elements. Math Probl Cybernet 4:218\u2013228","journal-title":"Math Probl Cybernet"},{"key":"689_CR17","unstructured":"Lovasz L, Young N (2002) Lecture notes on evasiveness of graph properties. arXiv preprint arXiv:cs\/0205031"},{"issue":"4","key":"689_CR18","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1134\/S1995080215040277","volume":"36","author":"S Lozhkin","year":"2015","unstructured":"Lozhkin S, Shupletsov M (2015) 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","journal-title":"Lobachevskii J Math"},{"key":"689_CR19","unstructured":"Nikolaevich VM (1961) On the power of networks of functional elements. In: Proceedings of the USSR academy of sciences. Volume 139., Russian Academy of Sciences 320\u2013323"},{"issue":"4","key":"689_CR20","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF01263419","volume":"4","author":"N Nisan","year":"1994","unstructured":"Nisan N, Szegedy M (1994) On the degree of boolean functions as real polynomials. Comput Complex 4(4):301\u2013313","journal-title":"Comput Complex"},{"issue":"6","key":"689_CR21","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0020-0190(93)90041-7","volume":"45","author":"A Razborov","year":"1993","unstructured":"Razborov A, Wigderson A (1993) $$n^{\\Omega (\\log n)}$$ lower bounds on the size of depth-$$3$$ threshold cicuits with AND gates at the bottom. Inf Process Lett 45(6):303\u2013307","journal-title":"Inf Process Lett"},{"issue":"3","key":"689_CR22","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/0304-3975(76)90053-0","volume":"3","author":"RL Rivest","year":"1976","unstructured":"Rivest RL, Vuillemin J (1976) On recognizing graph properties from adjacency matrices. Theoret Comput ence 3(3):371\u2013384","journal-title":"Theoret Comput ence"},{"issue":"29","key":"689_CR23","doi-asserted-by":"publisher","first-page":"3524","DOI":"10.1016\/j.tcs.2011.02.042","volume":"412","author":"X Sun","year":"2011","unstructured":"Sun X (2011) An improved lower bound on the sensitivity complexity of graph properties. Theoret Comput Sci 412(29):3524\u20133529","journal-title":"Theoret Comput Sci"},{"key":"689_CR24","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 (2013) Energy and fan-in of logic circuits computing symmetric boolean functions. Theoret Comput Sci 505:74\u201380","journal-title":"Theoret Comput Sci"},{"issue":"3","key":"689_CR25","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0020-0190(84)90019-X","volume":"18","author":"G Tur\u00e1n","year":"1984","unstructured":"Tur\u00e1n G (1984) The critical complexity of graph properties. Inf Process Lett 18(3):151\u2013153","journal-title":"Inf Process Lett"},{"issue":"1\u20133","key":"689_CR26","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 (2008) Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity. Theoret Comput Sci 407(1\u20133):474\u2013487","journal-title":"Theoret Comput Sci"},{"issue":"12","key":"689_CR27","doi-asserted-by":"publisher","first-page":"2994","DOI":"10.1162\/neco.2006.18.12.2994","volume":"18","author":"K Uchizawa","year":"2006","unstructured":"Uchizawa K, Douglas R, Maass W (2006) On the computational power of threshold circuits with sparse activity. Neural Comput 18(12):2994\u20133008","journal-title":"Neural Comput"},{"issue":"44\u201346","key":"689_CR28","doi-asserted-by":"publisher","first-page":"3938","DOI":"10.1016\/j.tcs.2010.08.006","volume":"411","author":"K Uchizawa","year":"2010","unstructured":"Uchizawa K, Nishizeki T, Takimoto E (2010) Energy and depth of threshold circuits. Theoret Comput Sci 411(44\u201346):3938\u20133946","journal-title":"Theoret Comput Sci"},{"issue":"8\u201310","key":"689_CR29","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1016\/j.tcs.2010.11.022","volume":"412","author":"K Uchizawa","year":"2011","unstructured":"Uchizawa K, Takimoto E, Nishizeki T (2011) Size-energy tradeoffs for unate circuits computing symmetric boolean functions. Theoret Comput Sci 412(8\u201310):773\u2013782","journal-title":"Theoret Comput Sci"},{"issue":"3","key":"689_CR30","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1137\/0217031","volume":"17","author":"ACC Yao","year":"1988","unstructured":"Yao ACC (1988) Monotone bipartite graph properties are evasive. SIAM J Comput 17(3):517\u2013520","journal-title":"SIAM J Comput"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00689-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-020-00689-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00689-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T18:01:10Z","timestamp":1657735270000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-020-00689-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,7]]},"references-count":30,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["689"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00689-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,7]]},"assertion":[{"value":"28 December 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}