{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T00:35:26Z","timestamp":1764981326870,"version":"3.46.0"},"reference-count":33,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,4,22]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Boolean functions have important applications in molecular regulatory networks, engineering, cryptography, information technology, and computer science. Symmetric Boolean functions have received a lot of attention in several decades. Sensitivity and block sensitivity are important complexity measures of Boolean functions. In this paper, we study the sensitivity of elementary symmetric Boolean functions and obtain many explicit formulas. We also obtain a formula for the block sensitivity of symmetric Boolean functions and discuss its applications in elementary symmetric Boolean functions.<\/jats:p>","DOI":"10.1515\/jmc-2020-0042","type":"journal-article","created":{"date-parts":[[2021,4,25]],"date-time":"2021-04-25T16:47:46Z","timestamp":1619369266000},"page":"434-453","source":"Crossref","is-referenced-by-count":1,"title":["Sensitivities and block sensitivities of elementary symmetric Boolean functions"],"prefix":"10.1515","volume":"15","author":[{"given":"Jing","family":"Zhang","sequence":"first","affiliation":[{"name":"Mathematics Department, Governors State University , IL , 60484 , USA"}]},{"given":"Yuan","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Winston-Salem State University , NC , 27110 , USA"}]},{"given":"John O.","family":"Adeyeye","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Winston-Salem State University , NC , 27110 , USA"}]}],"member":"374","published-online":{"date-parts":[[2021,4,22]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Arnold RF\n, \nHarrison MA\n. Algebraic properties of symmetric and partially symmetric Boolean functions. IEEE Trans Electronic Comput. 1963;EC-12\n(3):244\u201351.","key":"2025120600293902310_j_jmc-2020-0042_ref_001","DOI":"10.1109\/PGEC.1963.263535"},{"doi-asserted-by":"crossref","unstructured":"Cai J-Y\n, \nGreen F\n, \nThierauf T.\n On the correlation of symmetric functions. Math Syst Theory. 1996;29\n(3):245\u201358.","key":"2025120600293902310_j_jmc-2020-0042_ref_002","DOI":"10.1007\/BF01201278"},{"doi-asserted-by":"crossref","unstructured":"Canteaut A\n, \nVideau M.\n Symmetric Boolean functions. IEEE Trans Inf Theory. 2005;51\n(8):2791\u2013811.","key":"2025120600293902310_j_jmc-2020-0042_ref_003","DOI":"10.1109\/TIT.2005.851743"},{"doi-asserted-by":"crossref","unstructured":"Castro FN\n, \nGonz\u00e1lez OE\n, \nMedina LA.\n A divisibility approach to the open boundary cases of Cusick-Li-St\u0103nic\u0103s conjecture. Cryptogr Commun. 2015;7\n(4):379\u2013402.","key":"2025120600293902310_j_jmc-2020-0042_ref_004","DOI":"10.1007\/s12095-015-0124-y"},{"doi-asserted-by":"crossref","unstructured":"Castro FN\n, \nGonz\u00e1lez OE\n, \nMedina LA.\n Diophantine equations with binomial coefficients and perturbation of symmetric Boolean functions. IEEE Trans Inf Theory. 2018;143 64\n(2):1347\u201360.","key":"2025120600293902310_j_jmc-2020-0042_ref_005","DOI":"10.1109\/TIT.2017.2750674"},{"doi-asserted-by":"crossref","unstructured":"Castro FN\n, \nMedina LA.\n Asymptotic behavior of perturbations of symmetric functions. Ann Combin. 2014;18:397\u2013417.","key":"2025120600293902310_j_jmc-2020-0042_ref_006","DOI":"10.1007\/s00026-014-0230-0"},{"doi-asserted-by":"crossref","unstructured":"Cook SA\n, \nDwork C\n, \nReischuk R.\n Upper and lower time bounds for parallel random access machines without simultaneous writes. SIAM J Comput. 1986;15:87\u20139.","key":"2025120600293902310_j_jmc-2020-0042_ref_007","DOI":"10.1137\/0215006"},{"doi-asserted-by":"crossref","unstructured":"Cusick TW\n, \nLi Y\n, \nSt\u0103nic\u0103 P.\n Balanced symmetric functions over \nGF(p)\n\n. IEEE Trans Inf Theory. 2008;54:1304\u20137.","key":"2025120600293902310_j_jmc-2020-0042_ref_008","DOI":"10.1109\/TIT.2007.915920"},{"doi-asserted-by":"crossref","unstructured":"Cusick TW\n, \nLi Y\n, \nSt\u0103nic\u0103 P.\n On a conjecture for balanced symmetric Boolean functions. J Math Crypt. 2009;3:273\u201390.","key":"2025120600293902310_j_jmc-2020-0042_ref_009","DOI":"10.1515\/JMC.2009.017"},{"doi-asserted-by":"crossref","unstructured":"Das SR\n, \nSheng CL.\n On detecting total or partial symmetry of switching functions. IEEE Trans Comput. 1971;C-20\n(3):352\u20135.","key":"2025120600293902310_j_jmc-2020-0042_ref_010","DOI":"10.1109\/T-C.1971.223243"},{"doi-asserted-by":"crossref","unstructured":"Drucker A.\n Block sensitivity of minterm-transitive functions. Theor Comput Sci. 2011;412:5796\u2013801.","key":"2025120600293902310_j_jmc-2020-0042_ref_011","DOI":"10.1016\/j.tcs.2011.06.025"},{"doi-asserted-by":"crossref","unstructured":"Fredman M\n, \nKhachiyan L.\n On the complexity of dualization of monotone disjunctive normal forms. J Algorithms. 1996;21:618\u201328.","key":"2025120600293902310_j_jmc-2020-0042_ref_012","DOI":"10.1006\/jagm.1996.0062"},{"doi-asserted-by":"crossref","unstructured":"Gao G-P\n, \nLiu W-F\n, \nZhang X-Y.\n The degree of balanced elementary symmetric Boolean functions of \n4k+3\n variables. IEEE Trans Inf Theory. 2011;57:4822\u20135.","key":"2025120600293902310_j_jmc-2020-0042_ref_013","DOI":"10.1109\/TIT.2011.2145910"},{"doi-asserted-by":"crossref","unstructured":"Guo Y\n, \nGao G\n, \nZhao Y.\n Recent results on balanced symmetric Boolean functions. IEEE Trans Inf Theory. 2016;62:5199\u2013203.","key":"2025120600293902310_j_jmc-2020-0042_ref_014","DOI":"10.1109\/TIT.2015.2455052"},{"doi-asserted-by":"crossref","unstructured":"Huang H.\n Induced subgraphs of hypercubes and a proof of the sensitivity conjecture. Ann Math. 2019;190\n(3):945\u201355.","key":"2025120600293902310_j_jmc-2020-0042_ref_015","DOI":"10.4007\/annals.2019.190.3.6"},{"doi-asserted-by":"crossref","unstructured":"Kenyon C\n, \nKutin S.\n Sensitivity, block sensitivity, and \nl\n-block sensitivity of Boolean functions. Information and Computation. 2004;189:43\u201353.","key":"2025120600293902310_j_jmc-2020-0042_ref_016","DOI":"10.1016\/j.ic.2002.12.001"},{"doi-asserted-by":"crossref","unstructured":"Li N\n, \nQi W-F.\n Symmetric Boolean functions depending on an odd Number of variables with maximum algebraic immunity. IEEE Trans Inf Theory. 2006;52\n(5):2271\u20133","key":"2025120600293902310_j_jmc-2020-0042_ref_017","DOI":"10.1109\/TIT.2006.872977"},{"doi-asserted-by":"crossref","unstructured":"Li Y\n, \nAdeyeye JO.\n Maximal sensitivity of Boolean nested canalizing functions. Theor Comput Sci. 2019;791:116\u201322. An early version appeared in Arxiv:1209.1597v1 [cs.DM] 7 Sept 2012.","key":"2025120600293902310_j_jmc-2020-0042_ref_018","DOI":"10.1016\/j.tcs.2019.04.025"},{"doi-asserted-by":"crossref","unstructured":"Li Y\n, \nAdeyeye JO\n, \nMurrugarra D\n, \nAguilar B\n, \nLaubenbacher R.\n Boolean nested canalizing functions: a comprehensive analysis. Theor Comput Sci. 2013;481:24\u201336.","key":"2025120600293902310_j_jmc-2020-0042_ref_019","DOI":"10.1016\/j.tcs.2013.02.020"},{"unstructured":"Lidl R\n, \nNiederreiter H.\n Finite fields, New York: Cambridge University Press; 1977.","key":"2025120600293902310_j_jmc-2020-0042_ref_020"},{"doi-asserted-by":"crossref","unstructured":"Maitra S\n, \nSarker P.\n Maximum nonlinearity of symmetric Boolean functions on odd number of variables. IEEE Trans Inf Theory. 2002;48\n(9):2626\u201330.","key":"2025120600293902310_j_jmc-2020-0042_ref_021","DOI":"10.1109\/TIT.2002.801482"},{"doi-asserted-by":"crossref","unstructured":"Mishchenko A.\n Fast computation of symmetries in Boolean function. IEEE Trans Comput-Aided Design Integr Circuits Syst. 2003;22\n(11):1588\u201393.","key":"2025120600293902310_j_jmc-2020-0042_ref_022","DOI":"10.1109\/TCAD.2003.818371"},{"doi-asserted-by":"crossref","unstructured":"Mitchell CJ.\n Enumerating Boolean functions of cryptographic significance. J Crypto. 1990;2\n(3):155\u201370.","key":"2025120600293902310_j_jmc-2020-0042_ref_023","DOI":"10.1007\/BF00190802"},{"doi-asserted-by":"crossref","unstructured":"Nisan N.\n CREW PRAMs and decision tree. SIAM J Comput. 1991;20\n(6):999\u20131007.","key":"2025120600293902310_j_jmc-2020-0042_ref_024","DOI":"10.1137\/0220062"},{"doi-asserted-by":"crossref","unstructured":"Qian X-N\n, \nDougherty ER.\n A comparative study on sensitivities of Boolean networks. 2010 IEEE International Workshop on Genomic Signal Processing and Statistics (GENSIPS). NY: Cold Spring Harbor; 2010 p. 1\u20134.","key":"2025120600293902310_j_jmc-2020-0042_ref_025","DOI":"10.1109\/GENSIPS.2010.5719682"},{"doi-asserted-by":"crossref","unstructured":"Rubinstein D.\n Sensitivity VS block sensitivity of Boolean functions. Combinatorica. 1995;15\n(2):297\u20139.","key":"2025120600293902310_j_jmc-2020-0042_ref_026","DOI":"10.1007\/BF01200762"},{"doi-asserted-by":"crossref","unstructured":"Savicky P.\n On the bent Boolean functions that are symmetric. Europ J Combin. 1994;15:407\u201310.","key":"2025120600293902310_j_jmc-2020-0042_ref_027","DOI":"10.1006\/eujc.1994.1044"},{"doi-asserted-by":"crossref","unstructured":"Shannon CE.\n A symbolic analysis of relay and switching circuits. AIEE Trans. 1938;57:713\u201323.","key":"2025120600293902310_j_jmc-2020-0042_ref_028","DOI":"10.1109\/EE.1938.6431064"},{"unstructured":"Shmulevich I.\n Average sensitivity of typical monotone Boolean functions. arXiv:math\/0507030v1 [math.Co]\n2005; p. 1.","key":"2025120600293902310_j_jmc-2020-0042_ref_029"},{"doi-asserted-by":"crossref","unstructured":"Shmulevich I\n, \nKauffman SA.\n Activities and sensitivities in Boolean network models. Phys Rev Lett. 2004;93\n(4):048701.","key":"2025120600293902310_j_jmc-2020-0042_ref_030","DOI":"10.1103\/PhysRevLett.93.048701"},{"doi-asserted-by":"crossref","unstructured":"Su W\n, \nTang X-H\n, \nAlexander P.\n A note on a conjecture for balanced elementary symmetric Boolean functions. IEEE Trans Inf Theory. 2013;59:665\u201371.","key":"2025120600293902310_j_jmc-2020-0042_ref_031","DOI":"10.1109\/TIT.2012.2215576"},{"doi-asserted-by":"crossref","unstructured":"Sun X.\n Block sensitivity of weakly symmetric functions. Theor Comput Sci. 2007;384:87\u201391.","key":"2025120600293902310_j_jmc-2020-0042_ref_032","DOI":"10.1016\/j.tcs.2007.05.020"},{"doi-asserted-by":"crossref","unstructured":"Wegener I.\n The critical complexity of all (monotone) Boolean functions and monotone graph properties. Inf Control. 1985;67:212\u201322.","key":"2025120600293902310_j_jmc-2020-0042_ref_033","DOI":"10.1016\/S0019-9958(85)80036-X"}],"container-title":["Journal of Mathematical Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2020-0042\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2020-0042\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T00:30:32Z","timestamp":1764981032000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2020-0042\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,1]]},"references-count":33,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2020,11,17]]},"published-print":{"date-parts":[[2020,11,17]]}},"alternative-id":["10.1515\/jmc-2020-0042"],"URL":"https:\/\/doi.org\/10.1515\/jmc-2020-0042","relation":{},"ISSN":["1862-2984"],"issn-type":[{"type":"electronic","value":"1862-2984"}],"subject":[],"published":{"date-parts":[[2021,1,1]]}}}