{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,10]],"date-time":"2023-12-10T10:28:37Z","timestamp":1702204117397},"reference-count":157,"publisher":"Springer Science and Business Media LLC","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Synthesis Lectures on Digital Circuits and Systems"],"published-print":{"date-parts":[[2009,1]]},"DOI":"10.2200\/s00243ed1v01y200912dcs026","type":"journal-article","created":{"date-parts":[[2009,12,22]],"date-time":"2009-12-22T19:26:46Z","timestamp":1261510006000},"page":"1-153","source":"Crossref","is-referenced-by-count":2,"title":["Progress in Applications of Boolean Functions"],"prefix":"10.1007","volume":"4","author":[{"given":"Tsutomu","family":"Sasao","sequence":"first","affiliation":[]},{"given":"Jon T.","family":"Butler","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"p_46","volume-title":"Learning, Applications","author":"Aizenberg I.N.","year":"2000"},{"key":"p_47","first-page":"1","author":"Aizenberg N.N.","year":"1977","journal-title":"Ukraine"},{"key":"p_48","first-page":"1","volume":"1","author":"Astola H.","year":"2009","journal-title":"Research Seminar"},{"key":"p_49","volume-title":"Fundamentals of Switching Theory and Logic Design","author":"Astola J.T.","year":"2006"},{"key":"p_50","volume-title":"Techniques, Algorithms","author":"Cameron P.J.","year":"1994"},{"issue":"10","key":"p_51","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1049\/el:19990549","volume":"35","author":"Chang C.H.","year":"1999","journal-title":"Electronics Letters"},{"key":"p_52","doi-asserted-by":"crossref","unstructured":"C.H. Chang, and B.J. Falkowski , \"Reed-Muller weight and literal vectors for NPN -classification ,\"Proc. IEEE Int. Symp. on Circuits and Systems, ISCAS '99,May 30 -June2,1999 , Vol.1 , 379-382. DOI: 10.1109\/ISCAS.1999.777882 1.310.1109\/ISCAS.1999.777882","DOI":"10.1109\/ISCAS.1999.777882"},{"key":"p_53","first-page":"1","volume":"34","author":"Chow C.K.","year":"1961","journal-title":"Proc. IEEE Symp. Switching Theory and Logic Design"},{"key":"p_54","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2006.114"},{"key":"p_55","first-page":"12","volume":"87","author":"Debnath D.","year":"2004","journal-title":"IEICE Trans. Fundamentals"},{"key":"p_56","doi-asserted-by":"publisher","DOI":"10.1093\/ietfec"},{"key":"p_57","volume-title":"Synthesis and Optimization of Digital Circuits","author":"Micheli G. De","year":"1994"},{"key":"p_58","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1975.224082"},{"key":"p_59","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1109\/TC.1976.1674689","author":"Edwards C.R.","year":"1976","journal-title":"IEEE Trans. Computers"},{"key":"p_60","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1959.1057543"},{"key":"p_61","unstructured":"E. Goto , \"Threshold, majority and bilateral switching devices,\" in Aiken, H., Main, W.F. (eds.), Switching Theory in Space Technology ,Proceedings of the Symposium held in Sunnyvale, California, February 27-28 andMarch1,1962 ,Stanford University Press, 1963. 1.5"},{"key":"p_62","first-page":"1","volume":"747","author":"Goto E.","year":"1962","journal-title":"Proc. IFIP Congress, North-Holland"},{"key":"p_63","doi-asserted-by":"crossref","unstructured":"T. Gowda, S. Leshner, S. Vrudhula, and G. Konjevod , \"Synthesis of threshold logic circuits using tree matching ,\"Proc.18th European Conference on Circuit Theory and Design,2007 . DOI: 10.1109\/ECCTD.2007.4529730 1.510.1109\/ECCTD.2007.4529730","DOI":"10.1109\/ECCTD.2007.4529730"},{"key":"p_64","doi-asserted-by":"crossref","unstructured":"T. Gowda, and S. Vrudhula , \"A decomposition based approach for synthesis of multi-level threshold logic circuits ,\"Proc. Asia and South Pacific Design Automation Conference,Seoul, Korea, 21January2008 , 125 - 130. 1.5","DOI":"10.1109\/ASPDAC.2008.4483925"},{"key":"p_65","volume-title":"Introduction to Switching and Automata Theory","author":"Harrison M.A.","year":"1965"},{"key":"p_66","first-page":"1","volume":"1","author":"Harrison M.A.","year":"1962","journal-title":"USA"},{"key":"p_67","first-page":"1","author":"Hurst D.L.","year":"1978","journal-title":"London and Basel"},{"issue":"6","key":"p_68","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1080\/00207218408938876","volume":"56","author":"Hurst S.L.","year":"1984","journal-title":"Int. Journal of Electronics"},{"key":"p_69","doi-asserted-by":"crossref","DOI":"10.1016\/0165-1684(85)90052-0","volume-title":"Spectral Techniques in Digital Logic","author":"Hurst S.L.","year":"1985"},{"key":"p_70","first-page":"c1","volume":"9","author":"Jain A.","year":"1993","journal-title":"Proc. Int. Workshop on Logic Synthesis"},{"key":"p_71","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1965.264254"},{"key":"p_72","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1963.263597"},{"key":"p_73","unstructured":"N. Koda, and T. Sasao , \"LP -equivalence class of logic functions,\" IFIP 10.5 Workshop on Application of the Reed-Muller expansion in Circuit Design,Hamburg, Germany,September1993 , 99-106. 1.5, 1.3, 1.4, 1.4"},{"key":"p_74","first-page":"1","volume":"76","author":"Koda N.","year":"1993","journal-title":"Trans. IEICE Japan, Part D-I"},{"key":"p_75","unstructured":"N. Koda, and T. Sasao , \"An upper bound on the number of products in minimum ESOPs,\" IFIP WG 10.5 Workshop on Applications of the Reed-Muller Expansions in Circuit Design (Reed-Muller 95),Makuhari, Japan,August1995 , 27-29. 1.4, 1.4, 1.9"},{"key":"p_76","doi-asserted-by":"publisher","DOI":"10.1002\/scj.4690270901"},{"key":"p_77","first-page":"6","volume":"1","author":"Lawson C.L.","year":"1961","journal-title":"Los Angeles"},{"key":"p_78","volume-title":"Mukhopadhyay, A., (ed.), Recent Developments in Switching Theory","author":"Lechner R.J.","year":"1971"},{"key":"p_79","doi-asserted-by":"publisher","DOI":"10.1049\/el:19780164"},{"key":"p_80","volume-title":"Logic Design and Switching Theory","author":"Muroga S.","year":"1979"},{"key":"p_81","unstructured":"T. Sasao , \"A transformation of multiple-valued input two-valued output functions and its application to simplification of exclusive-or sum-of-products expressions ,\"Proc. Int. Symp. on Multiple-Valued Logic, Victoria,British Columbia, Canada,May26-29,1991 , 270-279. 1.4"},{"key":"p_82","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-5139-3","volume-title":"Switching Theory for Logic Synthesis","author":"Sasao T.","year":"1999"},{"key":"p_83","doi-asserted-by":"publisher","DOI":"10.1109\/12.45212"},{"key":"p_84","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-1385-4","volume-title":"Representations of Discrete Functions","author":"Sasao T.","year":"1996"},{"key":"p_85","unstructured":"R.S. Stankovi\u0107 , \"Some remarks on basic characteristics of decision diagrams ,\"Proc. 4th Int. Workshop on Applications of Reed-Muller Expansion in Circuit Design,August20-21,1999 ,Victoria, B.C., Canada, 139-146. 1.7"},{"key":"p_86","unstructured":"R.S. Stankovi\u0107, J.T. Astola, and B. Steinbach , \"Former and recent work in classification of switching functions ,\"Proc. 8th Int. Workshop on Boolean Problems,Freiberg, Germany,September18-19,2008 . 1.3"},{"key":"p_87","unstructured":"R. S. Stankovi\u0107, C. Moraga, and T. Sasao , \"Spectral transform decision diagrams ,\"Proc. IFIP WG 10.5 Workshop on Application of the Reed-Muller Expansion in Circuit Design, Reed-Muller'95,August27-29,1995 ,Makuhari, Chiba, Japan, 46-53. 1.7"},{"key":"p_89","unstructured":"R.S. Stankovi\u0107, S. Stankovi\u0107, and J.T. Astola ,\"Remarks on the representation of prototype functions in LP -classification by Walsh decision diagrams ,\"Proc. Reed-Muller Workshop, Naha,Okinawa, Japan,May23-24,2009 . 1.7"},{"key":"p_90","doi-asserted-by":"publisher","DOI":"10.1093\/ietisy"},{"key":"p_91","doi-asserted-by":"publisher","DOI":"10.1109\/12.565592"},{"key":"p_92","volume-title":"A Course in Combinatorics","author":"Van Lint J.H.","year":"1992"},{"key":"p_93","volume-title":"Decision Diagram Technique for Micro - and Nanoelectronic Design","author":"Yanushkevich S.N.","year":"2006"},{"key":"p_94","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1975.224271"},{"key":"p_95","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1976.1674688"},{"key":"p_96","volume-title":"Lauwereins, R., Madsen, J., Design, Automation, and Test in Europe The Most Influential Papers of 10 Years DATE","author":"Zhang R.","year":"2008"},{"key":"p_97","unstructured":"C. Carlet, and A. Klapper , \"Upper bounds on the numbers of resilient functions and of bent functions ,\"Proc. of the 23rd Symposium on InformationTheory in the Benelux, Louvain-La-Neuve, Belgique, Mai 2002 Publie par \"Werkgemeeschal voor Informatie-en Communicatietheorie, Enschede, The Nederlands, pp.307 -314 ,2002 . 2.2"},{"key":"p_98","volume-title":"Cryptographic Boolean Functions and Applications","author":"Cusick T. W.","year":"2009"},{"key":"p_99","volume-title":"Crytographer's toolkit for construction of 8-bit bent functions","author":"Dobbertin H.","year":"2005"},{"key":"p_100","doi-asserted-by":"crossref","unstructured":"R. Forr\u00e9 , \"The strict avalanche criterion: Spectral properties of Boolean functions and an extended definition,\" Advances in cryptology, Crypto'88, pp.450 -468 . 2.4","DOI":"10.1007\/0-387-34799-2_31"},{"key":"p_101","doi-asserted-by":"crossref","DOI":"10.1515\/9781400842902","volume-title":"Hadamard Matrices and Their Applications","author":"Horadam K. J.","year":"2007"},{"key":"p_102","doi-asserted-by":"publisher","DOI":"10.1002\/9780470289228"},{"issue":"5","key":"p_103","doi-asserted-by":"crossref","first-page":"1743","DOI":"10.1109\/TIT.2007.894696","volume":"53","author":"Kavut S.","year":"2007","journal-title":"IEEE Trans. on Infor.Theory"},{"key":"p_104","unstructured":"S. Kavut, and M. D. Y\u00fccel , \"9-variable Boolean functions with nonlinearity 242 in the generalized rotation class,\" Cryptology EPrint Report 2006\/181 ,28 May, 2006. http:\/\/eprint.iacr.org\/2006\/131 2.7"},{"key":"p_105","unstructured":"D. Knuth, The Art Computer Programming, and Fascicle , \"Introduction to combinatorial algorithms and Boolean functions ,\"Addison-Wesley Publishing Company, pp.95 -96 and p. 180,2008 . 2.2"},{"key":"p_106","volume-title":"Classification of Boolean quartics forms in eight variables","author":"Langevin P.","year":"2007"},{"key":"p_107","volume-title":"Cryptology EPrint, Report 2007\/309","author":"Maitra S.","year":"2007"},{"key":"p_108","series-title":"Lecture Notes in Computer Sciences, no. 839","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-48658-5_1","volume-title":"Advances in Cryptology CRYPTO '94","author":"Matsui M.","year":"1994"},{"key":"p_109","series-title":"Lecture Notes in Computer Sciences, no. 765","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1007\/3-540-48285-7_33","volume-title":"Advances in Cryptology EUROCRYPT '93","author":"Matsui M.","year":"1994"},{"key":"p_110","series-title":"Lecture Notes in Computer Sciences, no. 434","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/3-540-46885-4_53","volume-title":"Advances in Cryptology EUROCRYPT '89","author":"Meier W.","year":"1990"},{"key":"p_111","first-page":"2","volume":"2","author":"Preneel B.","year":"1993","journal-title":"Belguim"},{"key":"p_112","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00234-6"},{"key":"p_113","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/0097-3165(76)90024-8","volume":"20","author":"Rothaus O. S.","year":"1976","journal-title":"Journal of Combinatorial Theory, Ser. A"},{"key":"p_114","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3154-8","volume-title":"Logic Synthesis and Optimization","author":"Sasao T.","year":"1993"},{"key":"p_115","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-1385-4","volume-title":"Representation of Discrete Functions","author":"Sasao T.","year":"1996"},{"key":"p_116","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-5139-3","volume-title":"Switching Theory for Logic Synthesis","author":"Sasao T.","year":"1999"},{"key":"p_117","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1006\/eujc.1994.1044","volume":"15","author":"Savicky P.","year":"1994","journal-title":"European J. of Combinatorials"},{"key":"p_118","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056949"},{"key":"p_119","doi-asserted-by":"crossref","unstructured":"X. Wang, J. Zhou, and Y. Zang , \"A note on homogeneous bent functions ,\"Eighth Inter. Conf. on Software Eng., Artificial Intelligence, Networking, and Parallel\/Distributed Computing, pp.138 -142 ,2007 . 2.2","DOI":"10.1109\/SNPD.2007.113"},{"key":"p_120","first-page":"23","volume":"2","author":"Wegener I.","year":"2000","journal-title":"Philadelphia"},{"key":"p_121","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/3-540-39799-X_41","volume-title":"Advances in Cryptology - Crypto '85 (1986)","volume":"218","author":"Webster I.","year":"1987"},{"key":"p_122","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2004.02.006"},{"key":"p_123","volume-title":"Institutt for informatikk","author":"Bergen Universitetet"},{"key":"p_125","doi-asserted-by":"publisher","DOI":"10.1137\/0107041"},{"key":"p_126","volume-title":"Binary Systems - A BOOLEAN Book","author":"Bochmann D.","year":"2008"},{"key":"p_127","first-page":"3","volume":"3","author":"Bochmann D.","year":"1981","journal-title":"Berlin"},{"issue":"2","key":"p_128","first-page":"1220","volume":"16","author":"Bucur I. I.","year":"2007","journal-title":"Studies in Informatics and Control, with Emphasis on Useful Applications of Advanced Technology"},{"issue":"56","key":"p_129","first-page":"87","volume":"1","author":"Huffman D. A.","year":"1958","journal-title":"Quarterly Progress Report"},{"key":"p_130","doi-asserted-by":"publisher","DOI":"10.1109\/DDECS.2009.5012095"},{"key":"p_131","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/978-1-4020-2075-9_4","volume-title":"S. N. Yanushkevich: Artificial Intelligence in Logic Design","author":"Lang C.","year":"2004"},{"key":"p_132","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1954.1057465"},{"key":"p_133","first-page":"1","volume":"3","author":"Davio M.","year":"1978","journal-title":"McGraw-Hill International"},{"key":"p_134","doi-asserted-by":"crossref","unstructured":"A. Mishchenko, B. Steinbach, and M. Perkowski , \"An algorithm for bi-decomposition of logic functions ,\"Proceedings of the 38th Design Automation Conference,Las Vegas (Nevada) USA, pp.103 -108 ,2001 . DOI: 10.1145\/378239.378353 3.1, 3.810.1145\/378239.378353","DOI":"10.1145\/378239.378353"},{"key":"p_135","first-page":"3","volume":"3","author":"Posthoff C.","year":"2004","journal-title":"The Netherlands"},{"issue":"4","key":"p_136","first-page":"297","volume":"9","author":"Steinbach B.","year":"1992","journal-title":"System Analysis and Modelling Simulation"},{"key":"p_137","doi-asserted-by":"crossref","unstructured":"B. Steinbach, and C. Lang , \"Complete bi-decomposition of multiple-valued functions using MIN and MAX gates ,\"Proceedings of the 35th International Symposium on Multiple-Valued Logic, (ISMVL 2005),Calgary, Canada, pp.69 -74 ,2005 . DOI: 10.1109\/ISMVL.2005.14 3.110.1109\/ISMVL.2005.14","DOI":"10.1109\/ISMVL.2005.14"},{"key":"p_138","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/978-1-4020-2075-9_6","volume-title":"S. N. Yanushkevich: Artificial Intelligence in Logic Design","author":"Steinbach B.","year":"2004"},{"key":"p_139","unstructured":"B. Steinbach, and C. Posthoff , \"Extended theory of Boolean normal forms ,\"Proceedings of the 6th Annual Hawaii International Conference on Statistics, Mathematics and Related Fields,Honolulu, Hawaii, pp.1124 -1139 ,2007 . 3.1"},{"key":"p_140","volume-title":"Logic Functions and Equations - Examples and Exercises","author":"Steinbach B.","year":"2009"},{"key":"p_141","unstructured":"B. Steinbach, and M. St\u00f6ckert , \"Design of fully testable circuits by functional decomposition and implicit test pattern generation ,\"Proceedings of the 12th IEEE VLSI Test Symposium,Cherry Hill (New Jersey) USA, pp.22 -27 ,1994 . 3.1, 3.8"},{"key":"p_142","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10286-8","volume-title":"Boolean Calculus of Differences","author":"Thayse A.","year":"1981"},{"key":"p_143","first-page":"1","volume":"3","author":"Yanushkevich S. N.","year":"1998","journal-title":"Poland"},{"key":"p_144","first-page":"56","volume-title":"Journal of Computational and Theoretical Nanoscience","author":"Yanushkevich S. N.","year":"2008"},{"key":"p_145","first-page":"3457","volume":"52","author":"Barenco A.","year":"1995","journal-title":"The American Physical Society"},{"issue":"6","key":"p_146","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1147\/rd.176.0525","volume":"17","author":"Bennett C. H.","year":"1973","journal-title":"IBM J. Res. Dev"},{"key":"p_147","doi-asserted-by":"crossref","unstructured":"K. Brace, R. Rudell, and R. Bryant , \"Efficient implementation of a BDD package ,\" InDesign Automation Conf., pages40 -45 ,1990 . DOI: 10.1145\/123186.123222 4.610.1145\/123186.123222","DOI":"10.1145\/123186.123222"},{"key":"p_148","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1986.1676819"},{"key":"p_149","doi-asserted-by":"publisher","DOI":"10.1364\/OL.12.000542"},{"key":"p_150","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-9260(02)00051-2"},{"key":"p_151","doi-asserted-by":"crossref","unstructured":"N. E\u00e9n, and N. S\u00f6rensson , \"An extensible SAT solver ,\" InSAT 2003, volume2919 of LNCS, pages502 -518 ,2004 . DOI: 10.1007\/b95238 4.4, 4.410.1007\/b95238","DOI":"10.1007\/b95238"},{"key":"p_152","doi-asserted-by":"publisher","DOI":"10.1145\/1403375.1403707"},{"key":"p_153","doi-asserted-by":"publisher","DOI":"10.1007\/BF01857727"},{"key":"p_154","doi-asserted-by":"crossref","unstructured":"D. Gro\u00dfe, R. Wille, G. W. Dueck, and R. Drechsler , \"Exact synthesis of elementary quantum gate circuits for reversible functions with don't cares,\" In Int'l Symp. on Multi-Valued Logic, pages214 -219 ,2008 . DOI: 10.1109\/ISMVL.2008.42 4.410.1109\/ISMVL.2008.42","DOI":"10.1109\/ISMVL.2008.42"},{"key":"p_155","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2009.2017215"},{"key":"p_156","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2006.871622"},{"key":"p_157","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.858352"},{"key":"p_158","doi-asserted-by":"crossref","unstructured":"P. Kerntopf , \"A new heuristic algorithm for reversible logic synthesis ,\" InDesign Automation Conf., pages834 -837 ,2004 . DOI: 10.1145\/996566.996789 4.5, 4.610.1145\/996566.996789","DOI":"10.1145\/996566.996789"},{"key":"p_159","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1147\/rd.53.0183","volume":"5","author":"Landauer R.","year":"1961","journal-title":"IBM J. Res. Dev."},{"key":"p_160","doi-asserted-by":"publisher","DOI":"10.1049\/el:20031202"},{"key":"p_161","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2004.836735"},{"key":"p_162","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.847911"},{"key":"p_163","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2005.249"},{"key":"p_164","doi-asserted-by":"publisher","DOI":"10.1088\/0957-4484"},{"key":"p_165","doi-asserted-by":"crossref","unstructured":"D. M. Miller, D. Maslov, and G. W. Dueck , \"A transformation based algorithm for reversible logic synthesis ,\" InDesign Automation Conf., pages318 -323 ,2003 . DOI: 10.1145\/775832.775915 4.5, 4.5, 4.610.1145\/775832.775915","DOI":"10.1145\/775832.775915"},{"key":"p_166","doi-asserted-by":"crossref","unstructured":"D. M. Miller, R. Wille, and G. W. Dueck , \"Synthesizing reversible circuits for irreversible functions ,\" InEuromicro Conf. on Digital System Design, pages749 -756 ,2009 . 4.3","DOI":"10.1109\/DSD.2009.186"},{"key":"p_167","volume-title":"Quantum Computation and Quantum Information","author":"Nielsen M.","year":"2000"},{"key":"p_168","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2004.831576"},{"key":"p_169","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.32.3266"},{"key":"p_170","doi-asserted-by":"crossref","unstructured":"M. Perkowski, J. Biamonte, and M. Lukac , \"Test generation and fault localization for quantum circuits,\" In Int'l Symp. on Multi-Valued Logic, pages62 -68 ,2005 . DOI: 10.1109\/ISMVL.2005.46 4.710.1109\/ISMVL.2005.46","DOI":"10.1109\/ISMVL.2005.46"},{"key":"p_171","doi-asserted-by":"crossref","unstructured":"I. Polian, T. Fiehn, B. Becker, and J. P. Hayes , \"A family of logical fault models for reversible circuits ,\" InAsian Test Symp., pages422 -427 ,2005 . DOI: 10.1109\/ATS.2005.9 4.710.1109\/ATS.2005.9","DOI":"10.1109\/ATS.2005.9"},{"key":"p_172","doi-asserted-by":"crossref","unstructured":"M. Saeedi, M. Sedighi, and M. S. Zamani , \"A novel synthesis algorithm for reversible circuits,\" In Int'l Conf. on CAD, pages65 -68 ,2007 . DOI: 10.1109\/ICCAD.2007.4397245 4.5, 4.610.1109\/ICCAD.2007.4397245","DOI":"10.1109\/ICCAD.2007.4397245"},{"key":"p_173","doi-asserted-by":"publisher","DOI":"10.1145\/1120725.1120847"},{"key":"p_174","doi-asserted-by":"publisher","DOI":"10.1145\/774572.774625"},{"key":"p_175","first-page":"4","author":"Somenzi F.","year":"2001","journal-title":"CU Decision Diagram Package Release 2.3.1. University of Colorado at Boulder"},{"key":"p_176","author":"Toffoli T.","year":"1980","journal-title":"W. de Bakker and J. van Leeuwen, editors, Automata, Languages and Programming, page 632. Springer"},{"key":"p_177","doi-asserted-by":"crossref","unstructured":"G. F. Viamontes, I. L. Markov, and J. P. Hayes , \"Checking equivalence of quantum circuits and states,\" In Int'l Conf. on CAD, pages69 -74 ,2007 . DOI: 10.1109\/ICCAD.2007.4397246 4.710.1109\/ICCAD.2007.4397246","DOI":"10.1109\/ICCAD.2007.4397246"},{"key":"p_178","doi-asserted-by":"publisher","DOI":"10.1093\/ietfec"},{"key":"p_179","doi-asserted-by":"crossref","unstructured":"R. Wille, and R. Drechsler , \"BDD-based synthesis of reversible logic for large functions ,\" InDesign Automation Conf., pages270 -275 ,2009 . DOI: 10.1145\/1629911.1629984 4.610.1145\/1629911.1629984","DOI":"10.1145\/1629911.1629984"},{"key":"p_180","doi-asserted-by":"publisher","DOI":"10.1109\/VLSI.Design.2009.40"},{"key":"p_181","first-page":"1284","author":"Wille R.","year":"2009","journal-title":"Design, Automation and Test in Europe, pages"},{"key":"p_182","doi-asserted-by":"crossref","unstructured":"R. Wille, D. Gro\u00dfe, D. M. Miller, and R. Drechsler , \"Equivalence checking of reversible circuits,\" In Int'l Symp. on Multi-Valued Logic, pages324 -330 ,2009 . DOI: 10.1109\/ISMVL.2009.19 4.710.1109\/ISMVL.2009.19","DOI":"10.1109\/ISMVL.2009.19"},{"key":"p_183","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2003.818324"},{"key":"p_184","doi-asserted-by":"crossref","unstructured":"J. Zhong, and J. Muzio , \"Using crosspoint faults in simplifying toffoli networks ,\" InIEEE North-East Workshop on Circuits and Systems, pages129 -132 ,2006 . DOI: 10.1109\/NEWCAS.2006.250942 4.710.1109\/NEWCAS.2006.250942","DOI":"10.1109\/NEWCAS.2006.250942"},{"key":"p_187","doi-asserted-by":"crossref","unstructured":"R. Agrawal, T. Imielinski, and A. N. Swami , \"Mining association rules between sets of items in large databases,\" In P. Buneman and S. Jajodia, editors ,Proc. of the 1993 ACM SIGMOD International Conference on Management of Data, Vol. 22(2) of SIGMOD Record, pages 207-216 ,1993 . DOI: 10.1145\/170035 5.1, 5.2.1, 5.3.110.1145\/170035","DOI":"10.1145\/170035"},{"key":"p_188","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1986.1676819"},{"key":"p_189","unstructured":"R. E. Bryant, and Y.A. Chen , \"Verification of arithmetic circuits with binary moment diagrams ,\" InProc. of 32th ACM\/IEEE Design Automation Conference (DAC-95), pages535 -541 ,1995 . DOI: 10.1145\/217474.21758310.1145\/217474.217583"},{"key":"p_190","volume-title":"Survey on frequent pattern mining","author":"Goethals B.","year":"2003"},{"key":"p_191","volume-title":"Frequent itemset mining dataset repository","author":"Goethals B.","year":"2003"},{"key":"p_192","unstructured":"J. Han, J. Pei, and Y. Yin , \"Mining frequent patterns without candidate generation ,\" InIn Proc of the 2000 ACM SIGMOD international conference on Management of data, pages1 -12 ,2000 . DOI: 10.1145\/342009.33537210.1145\/342009.335372"},{"key":"p_193","doi-asserted-by":"publisher","DOI":"10.1023\/B:DAMI.0000005258.31418.83"},{"key":"p_194","unstructured":"M. Ishihata, Y. Kameya, T. Sato, and S. Minato , \"Propositionalizing the em algorithm by BDDs ,\" InIn Proc of 18th International Conference on Inductive Logic Programming (ILP 2008), 92008 ."},{"key":"p_195","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2007.10.003"},{"key":"p_196","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.09.008"},{"key":"p_197","first-page":"2","volume":"5","author":"Knuth D. E.","year":"2009","journal-title":"Addison-Wesley"},{"key":"p_199","unstructured":"E. Loekito, and J. Bailey , \"Are zero-suppressed binary decision diagrams good for mining frequent patterns in high dimensional datasets? \" InProc. of the Sixth Australasian Data Mining Conference (AusDM 2007), pages135 -146 ,2007 ."},{"key":"p_200","doi-asserted-by":"crossref","unstructured":"S. Minato , \"Zero-suppressed BDDs for set manipulation in combinatorial problems ,\" InProc. of 30th ACM\/IEEE Design Automation Conference, pages272 -277 ,1993 . DOI: 10.1145\/157485.164890 5.1, 5.2.210.1145\/157485.164890","DOI":"10.1145\/157485.164890"},{"key":"p_201","unstructured":"S. Minato, and H. Arimura , \"Efficient combinatorial item set analysis based on zero-suppressed BDDs ,\" InProc. IEEE\/IEICE\/IPSJ International Workshop on Challenges in Web Information Retrieval and Integration (WIRI-2005), pages3 -10 , 42005 ."},{"key":"p_202","unstructured":"S. Minato, K. Satoh, and T. Sato , \"Compiling bayesian networks by symbolic probability calculation based on Zero-suppressed BDDs ,\" InProc. of 20th International Joint Conference of Artificial Intelligence (IJCAI-2007), pages2550 -2555 ,2007 ."},{"key":"p_203","unstructured":"S. Minato, and N. Spyratos , \"Combinatorial keyword query processing under a taxonomy model using Binary Decision diagrams ,\" InIn workshop note of Perspectives of Intelligent System's Assistance (PISA-2007), 82007 ."},{"key":"p_204","doi-asserted-by":"crossref","unstructured":"S. Minato, T. Uno, and H. Arimura , \"LCM over ZBDDs: Fast generation of very large-scale frequent itemsets using a compact graph-based representation ,\" InProc. of 12-th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD 2008), (LNAI 5012, Springer), pages 234-246, 52008 . DOI: 10.1007\/978-3-540-68125-0_22 5.3.2, 5.3.210.1007\/978-3-540-68125-0_22","DOI":"10.1007\/978-3-540-68125-0_22"},{"key":"p_205","volume-title":"Program codes of takeaki uno and hiroki arimura","author":"Uno T.","year":"2007"},{"key":"p_206","unstructured":"T. Uno, Y. Uchida, T. Asai, and H. Arimura , \"LCM: an efficient algorithm for enumerating frequent closed item sets ,\" InProc. Workshop on Frequent Itemset Mining Implementations (FIMI'03),2003 . http:\/\/fimi.cs.helsinki.fi\/src\/ 5.1, 5.3.1"},{"key":"p_207","doi-asserted-by":"publisher","DOI":"10.1109\/69.846291"}],"container-title":["Synthesis Lectures on Digital Circuits and Systems"],"original-title":[],"language":"en","deposited":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T00:31:42Z","timestamp":1685320302000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.morganclaypool.com\/doi\/abs\/10.2200\/S00243ED1V01Y200912DCS026"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1]]},"references-count":157,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,1]]}},"alternative-id":["10.2200\/S00243ED1V01Y200912DCS026"],"URL":"https:\/\/doi.org\/10.2200\/s00243ed1v01y200912dcs026","relation":{},"ISSN":["1932-3166","1932-3174"],"issn-type":[{"value":"1932-3166","type":"print"},{"value":"1932-3174","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1]]}}}