{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:08:14Z","timestamp":1742933294301,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319405773"},{"type":"electronic","value":"9783319405780"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-40578-0_19","type":"book-chapter","created":{"date-parts":[[2016,6,29]],"date-time":"2016-06-29T16:25:20Z","timestamp":1467217520000},"page":"255-270","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Enumeration of Reversible Functions and Its Application to Circuit Complexity"],"prefix":"10.1007","author":[{"given":"Mathias","family":"Soeken","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nabila","family":"Abdessaied","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovanni","family":"De Micheli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,30]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511608650","volume-title":"The Theory of Partitions","author":"GE Andrews","year":"1984","unstructured":"Andrews, G.E.: The Theory of Partitions. Cambridge University Press, Cambridge (1984)"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Ashenhurst, R.L.: The application of counting techniques. In: Proceedings of the ACM National Meeting, pp. 293\u2013305 (1952)","DOI":"10.1145\/609784.609825"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Beth, T., R\u00f6tteler, M.: Quantum algorithms: applicable algebra and quantum physics. In: Springer Tracts in Modern Physics, vol. 173, pp. 96\u2013150 (2001)","DOI":"10.1007\/3-540-44678-8_4"},{"issue":"2","key":"19_CR4","first-page":"59","volume":"52","author":"NG Bruijn De","year":"1959","unstructured":"De Bruijn, N.G.: Generalization of P\u00f3lya\u2019s fundamental theorem in enumerative combinational analysis. Konikl. Nederl. Akademie Van Wetenschappen A 52(2), 59\u201369 (1959)","journal-title":"Konikl. Nederl. Akademie Van Wetenschappen A"},{"key":"19_CR5","unstructured":"Draper, T.G.: Nonlinear complexity of Boolean permutations. Ph.D. thesis, University of Maryland (2009)"},{"issue":"9","key":"19_CR6","doi-asserted-by":"publisher","first-page":"1341","DOI":"10.1109\/TC.2011.144","volume":"61","author":"O Golubitsky","year":"2012","unstructured":"Golubitsky, O., Maslov, D.: A study of optimal 4-bit reversible toffoli circuits and their synthesis. IEEE Trans. Comput. 61(9), 1341\u20131353 (2012)","journal-title":"IEEE Trans. Comput."},{"key":"19_CR7","unstructured":"Harrison, M.A.: Combinational problems in Boolean algebras and applications to the theory of switching. Ph.D. thesis, University of Michigan (1963)"},{"issue":"1","key":"19_CR8","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/321150.321152","volume":"10","author":"MA Harrison","year":"1963","unstructured":"Harrison, M.A.: The number of classes of invertible Boolean functions. J. ACM 10(1), 25\u201328 (1963)","journal-title":"J. ACM"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1109\/PGEC.1963.263656","volume":"12","author":"MA Harrison","year":"1963","unstructured":"Harrison, M.A.: The number of equivalence classes of Boolean functions under groups containing negation. IEEE Trans. Electron. Comput. 12, 559\u2013561 (1963)","journal-title":"IEEE Trans. Electron. Comput."},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"806","DOI":"10.1137\/0111059","volume":"11","author":"MA Harrison","year":"1963","unstructured":"Harrison, M.A.: The number of transitivity sets of Boolean functions. J. Soc. Appl. Ind. Math. 11, 806\u2013828 (1963)","journal-title":"J. Soc. Appl. Ind. Math."},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1137\/0112026","volume":"12","author":"MA Harrison","year":"1964","unstructured":"Harrison, M.A.: On the classification of Boolean functions by the general linear and affine groups. J. Soc. Appl. Ind. Math. 12, 285\u2013299 (1964)","journal-title":"J. Soc. Appl. Ind. Math."},{"key":"19_CR12","unstructured":"Lorens, C.S.: Invertible Boolean functions. Technical report 21, Space-General Corporation, El Monte, California, Research Memorandum (1962)"},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1109\/PGEC.1964.263724","volume":"13","author":"CS Lorens","year":"1964","unstructured":"Lorens, C.S.: Invertible Boolean functions. IEEE Trans. Electron. Comput. 13, 529\u2013541 (1964)","journal-title":"IEEE Trans. Electron. Comput."},{"key":"19_CR14","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 f\u00fcr Gruppen, Graphen und Chemische Verbindungen. Acta Math. 68, 145\u2013253 (1937)","journal-title":"Acta Math."},{"issue":"6","key":"19_CR15","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1007\/BF01072161","volume":"20","author":"\u00c9A Primenko","year":"1984","unstructured":"Primenko, \u00c9.A.: Equivalence classes of invertible Boolean functions. Cybernetics 20(6), 771\u2013776 (1984)","journal-title":"Cybernetics"},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"185","DOI":"10.4153\/CJM-1953-020-x","volume":"5","author":"D Slepian","year":"1953","unstructured":"Slepian, D.: On the number of symmetry types of Boolean functions of \n                      \n                        \n                      \n                      $$n$$\n                     variables. Can. J. Math. 5, 185\u2013193 (1953)","journal-title":"Can. J. Math."},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Soeken, M., Thomsen, M.K.: White dots do matter: rewriting reversible logic circuits. In: International Conference on Reversible Computation, pp. 196\u2013208 (2013)","DOI":"10.1007\/978-3-642-38986-3_16"},{"key":"19_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1007\/3-540-10003-2_104","volume-title":"Automata, Languages and Programming","author":"T Toffoli","year":"1980","unstructured":"Toffoli, T.: Reversible computing. In: de Bakker, J.W., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85, pp. 632\u2013644. Springer, Heidelberg (1980)"},{"key":"19_CR19","doi-asserted-by":"publisher","first-page":"032315-1","DOI":"10.1103\/PhysRevA.69.032315","volume":"69","author":"F Vatan","year":"2004","unstructured":"Vatan, F., Williams, C.: Optimal quantum circuits for general two-qubit gates. Phys. Rev. A 69, 032315-1\u2013032315-5 (2004)","journal-title":"Phys. Rev. A"}],"container-title":["Lecture Notes in Computer Science","Reversible Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40578-0_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T00:44:26Z","timestamp":1558313066000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40578-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319405773","9783319405780"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40578-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"30 June 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}