{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T07:54:03Z","timestamp":1775289243829,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,11,29]],"date-time":"2018-11-29T00:00:00Z","timestamp":1543449600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61572109"],"award-info":[{"award-number":["61572109"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Special Fund of Bagui Scholars of Guangxi"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1007\/s00224-018-9903-0","type":"journal-article","created":{"date-parts":[[2018,11,28]],"date-time":"2018-11-28T23:30:27Z","timestamp":1543447827000},"page":"1278-1297","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Group Algebraic Approach to NPN Classification of Boolean Functions"],"prefix":"10.1007","volume":"63","author":[{"given":"Juling","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5133-0320","authenticated-orcid":false,"given":"Guowu","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William N. N.","family":"Hung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tian","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyu","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek A.","family":"Perkowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,29]]},"reference":[{"issue":"2","key":"9903_CR1","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1109\/12.565592","volume":"46","author":"C-C Tsai","year":"1997","unstructured":"Tsai, C.-C., Marek-Sadowska, M.: Boolean functions classification via fixed polarity reed-muller forms. IEEE Trans. Comput. 46(2), 173\u2013186 (1997)","journal-title":"IEEE Trans. Comput."},{"key":"9903_CR2","doi-asserted-by":"crossref","unstructured":"Braeken, A., Borissov, Y., Nikova, S., Preneel, B.: Classification of Boolean functions of 6 variables or less with respect to some cryptographic properties. In: Proc. 32nd International Conference on Automata, Languages and Programming, ser. ICALP\u201905, pp. 324\u2013334 (2005)","DOI":"10.1007\/11523468_27"},{"issue":"8","key":"9903_CR3","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1109\/TC.2006.114","volume":"55","author":"S Dautovic","year":"2006","unstructured":"Dautovic, S., Novak, L.: A comment on Boolean functions classification via fixed polarity reed-muller form. IEEE Trans. Comput. 55(8), 1067\u20131069 (2006)","journal-title":"IEEE Trans. Comput."},{"key":"9903_CR4","doi-asserted-by":"publisher","first-page":"1:1","DOI":"10.1155\/2011\/356137","volume":"2011","author":"JE Rice","year":"2011","unstructured":"Rice, J.E., Muzio, J.C., Anderson, N.: New considerations for spectral classification of Boolean switching functions. VLSI Design 2011, 1:1\u20131:9 (2011)","journal-title":"VLSI Design"},{"issue":"3","key":"9903_CR5","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1145\/264995.264996","volume":"2","author":"L Benini","year":"1997","unstructured":"Benini, L., De Micheli, G.: A survey of Boolean matching techniques for library binding. ACM Trans. Des. Autom. Electron. Syst. 2(3), 193\u2013226 (1997)","journal-title":"ACM Trans. Des. Autom. Electron. Syst."},{"key":"9903_CR6","doi-asserted-by":"crossref","unstructured":"Edwards, C.R., Hurst, S.L.: A Digital Synthesis Procedure Under Function Symmetries and Mapping Methods. IEEE Computer Society (1978)","DOI":"10.1109\/TC.1978.1674988"},{"key":"9903_CR7","doi-asserted-by":"crossref","unstructured":"Jain, A., Bryant, R.E.: Inverter minimization in multi-level logic networks. In: Proc. International Conference on Computer-Aided Design, ser. ICCAD \u201993, pp. 462\u2013465 (1993)","DOI":"10.1109\/ICCAD.1993.580098"},{"key":"9903_CR8","volume-title":"Device Handbook","author":"SV Devices","year":"2012","unstructured":"Devices, S.V., Stratix, V.: Device Handbook. Altera, San Jose (2012)"},{"issue":"1","key":"9903_CR9","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1109\/TIT.1972.1054732","volume":"18","author":"E Berlekamp","year":"1972","unstructured":"Berlekamp, E., Welch, L.: Weight distributions of the cosets of the (32,6) reed-muller code. IEEE Trans. Inf. Theory 18(1), 203\u2013207 (1972)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"195","key":"9903_CR10","first-page":"403","volume":"57","author":"JA Maiorana","year":"1991","unstructured":"Maiorana, J.A.: A classification of the cosets of the reed-muller code r (1, 6). Math. Comput. 57(195), 403\u2013414 (1991)","journal-title":"Math. Comput."},{"key":"9903_CR11","doi-asserted-by":"crossref","unstructured":"Borissov, Y., An, B., Nikova, S., Preneel, B.: Classification of the cosets of rm(1,7) in rm(3,7) revisited,\u201d NATO ASI on \u201dBoolean Functions in Cryptology and Information Security (2007)","DOI":"10.3233\/978-1-58603-878-6-58"},{"issue":"12","key":"9903_CR12","doi-asserted-by":"publisher","first-page":"3606","DOI":"10.1109\/TC.2016.2557329","volume":"65","author":"Y Zhang","year":"2016","unstructured":"Zhang, Y., Yang, G., Hung, W.N., Zhang, J.: Computing affine equivalence classes of Boolean functions by group isomorphism. IEEE Trans. Comput. 65(12), 3606\u20133616 (2016)","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"9903_CR13","first-page":"185","volume":"5","author":"D Slepian","year":"1955","unstructured":"Slepian, D.: On the number of symmetry types of Boolean functions of n variables. Can. J. Math. 5(2), 185\u2013193 (1955)","journal-title":"Can. J. Math."},{"key":"9903_CR14","doi-asserted-by":"crossref","unstructured":"Huang, Z., Wang, L., Nasikovskiy, Y., Mishchenko, A.: Fast Boolean matching based on npn classification. In: International Conference on Field-Programmable Technology, pp. 310\u2013313 (2013)","DOI":"10.1109\/FPT.2013.6718374"},{"key":"9903_CR15","doi-asserted-by":"crossref","unstructured":"Petkovska, A., Soeken, M., Micheli, G.D., Ienne, P., Mishchenko, A.: Fast hierarchical npn classification. In: International Conference on Field Programmable Logic and Applications, pp. 1\u20134 (2016)","DOI":"10.1109\/FPL.2016.7577306"},{"issue":"6","key":"9903_CR16","doi-asserted-by":"publisher","first-page":"1128","DOI":"10.1109\/TCAD.2008.923256","volume":"27","author":"A Abdollahi","year":"2008","unstructured":"Abdollahi, A., Pedram, M.: Symmetry detection and Boolean matching utilizing a signature-based canonical form of Boolean functions. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 27(6), 1128\u20131137 (2008)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"6","key":"9903_CR17","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1109\/TCAD.2009.2016547","volume":"28","author":"G Agosta","year":"2009","unstructured":"Agosta, G., Bruschi, F., Pelosi, G., Sciuto, D.: A transform-parametric approach to Boolean matching. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 28(6), 805\u2013817 (2009)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"9903_CR18","doi-asserted-by":"crossref","unstructured":"Matsunaga, Y.: Accelerating sat-based Boolean matching for heterogeneous fpgas using one-hot encoding and cegar technique. In: Design Automation Conference, pp. 255\u2013260 (2015)","DOI":"10.1109\/ASPDAC.2015.7059014"},{"issue":"5","key":"9903_CR19","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1109\/PGEC.1963.263656","volume":"EC-12","author":"MA Harrison","year":"1963","unstructured":"Harrison, M.A.: The number of equivalence classes of Boolean functions under groups containing negation. IEEE Transactions on Electronic Computers EC-12(5), 559\u2013561 (1963)","journal-title":"IEEE Transactions on Electronic Computers"},{"key":"9903_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0731-3","volume-title":"Permutation Groups","author":"JD Dixon","year":"1996","unstructured":"Dixon, J.D., Mortimer, B.: Permutation Groups. Springer, Berlin (1996)"},{"key":"9903_CR21","unstructured":"Cycle type of a permutation, http:\/\/groupprops.subwiki.org\/wiki\/Cycle_type_of_a_permutation"},{"key":"9903_CR22","unstructured":"Cycle index, http:\/\/en.wikipedia.org\/wiki\/Cycle_type"},{"key":"9903_CR23","unstructured":"Lipsett, R.: conjugacy classes in the symmetric group s n, http:\/\/planetmath.org\/?op=getobj;from=objects;id=9613"},{"key":"9903_CR24","unstructured":"Cycle type determines conjugacy class. http:\/\/groupprops.subwiki.org\/wiki\/Cycle_type_determines_conjugacy_class"},{"key":"9903_CR25","unstructured":"Brualdi, R.A.: Pearson Introductory combinatorics:united states edition (2009)"},{"key":"9903_CR26","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF02546665","volume":"68","author":"G P\u00f3lya","year":"1937","unstructured":"P\u00f3lya, G.: Kombinatorische anzahlbestimmungen for gruppen, graphen und chemische verbindungen. Acta Mathematica 68, 145\u2013254 (1937)","journal-title":"Acta Mathematica"},{"issue":"3","key":"9903_CR27","doi-asserted-by":"publisher","first-page":"433","DOI":"10.2307\/2370675","volume":"49","author":"JH Redfield","year":"1927","unstructured":"Redfield, J.H.: The theory of group-reduced distributions. Am. J. Math. 49 (3), 433\u2013455 (1927)","journal-title":"Am. J. Math."},{"key":"9903_CR28","unstructured":"Brualdi, R.A.: Introductory Combinatorics, 5th ed. Prentice Hall, January 2009, ch. 14"},{"key":"9903_CR29","unstructured":"Sloane, N J A: The on-line encyclopedia of integer sequence, https:\/\/oeis.org\/A000370"},{"issue":"3","key":"9903_CR30","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S1385-7258(59)50008-6","volume":"62","author":"NGD Bruijn","year":"1959","unstructured":"Bruijn, N.G.D.: Generalization of polya\u2019s fundamental theorem in enumerative combinatorial analysis. Indag. Math. 62(3), 59\u201369 (1959)","journal-title":"Indag. Math."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-018-9903-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-018-9903-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-018-9903-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T07:00:40Z","timestamp":1775286040000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-018-9903-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,29]]},"references-count":30,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["9903"],"URL":"https:\/\/doi.org\/10.1007\/s00224-018-9903-0","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,29]]},"assertion":[{"value":"29 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}