{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:57:53Z","timestamp":1742947073045,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319208596"},{"type":"electronic","value":"9783319208602"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-20860-2_14","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T08:15:57Z","timestamp":1434701757000},"page":"219-232","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Technology Mapping for Single Target Gate Based Circuits Using Boolean Functional Decomposition"],"prefix":"10.1007","author":[{"given":"Nabila","family":"Abdessaied","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mathias","family":"Soeken","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Drechsler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/978-3-319-08494-7_3","volume-title":"Reversible Computation","author":"SJ Devitt","year":"2014","unstructured":"Devitt, S.J.: Classical control of large-scale quantum computers. In: Yamashita, S., Minato, S. (eds.) RC 2014. LNCS, vol. 8507, pp. 26\u201339. Springer, Heidelberg (2014)"},{"key":"14_CR2","unstructured":"Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge Univ. Press (2000)"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"052312","DOI":"10.1103\/PhysRevA.80.052312","volume":"80","author":"AG Fowler","year":"2009","unstructured":"Fowler, A.G., Stephens, A.M., Groszkowski, P.: High-threshold universal quantum computation on the surface code. Physical Review A 80, 052312 (2009)","journal-title":"Physical Review A"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"3457","DOI":"10.1103\/PhysRevA.52.3457","volume":"52","author":"A Barenco","year":"1995","unstructured":"Barenco, A., Bennett, C.H., Cleve, R., DiVinchenzo, D., Margolus, N., Shor, P., Sleator, T., Smolin, J., Weinfurter, H.: Elementary gates for quantum computation. Physical Review A 52, 3457\u20133467 (1995)","journal-title":"Physical Review A"},{"issue":"6","key":"14_CR5","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1109\/TCAD.2005.847911","volume":"24","author":"D Maslov","year":"2005","unstructured":"Maslov, D., Dueck, G.W., Miller, D.M.: Toffoli network synthesis with templates. IEEE Trans. on CAD of Integrated Circuits and Systems 24(6), 807\u2013817 (2005)","journal-title":"IEEE Trans. on CAD of Integrated Circuits and Systems"},{"issue":"2","key":"14_CR6","doi-asserted-by":"publisher","first-page":"183","DOI":"10.3934\/amc.2008.2.183","volume":"2","author":"A De Vos","year":"2008","unstructured":"De Vos, A., Van Rentergem, Y.: Young subgroups for reversible computers. Advances in Mathematics of Communications 2(2), 183\u2013200 (2008)","journal-title":"Advances in Mathematics of Communications"},{"key":"14_CR7","unstructured":"Soeken, M., Tague, L., Dueck, G.W., Drechsler, R.: Ancilla-free synthesis of large reversible functions using binary decision diagrams (2014). CoRR abs\/1408.3955"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Sasao, T.: AND-EXOR expressions and their optimization. In: Sasao, T., (ed.) Logic Synthesis and Optimization. Kluwer Academic Publisher, pp. 287\u2013312 (1993)","DOI":"10.1007\/978-1-4615-3154-8_13"},{"key":"14_CR9","unstructured":"Ashenhurst, R.L.: The decomposition of switching functions. In: Int\u2019l Symp. on the Theory of Switching, pp. 74\u2013116 (1957)"},{"key":"14_CR10","volume-title":"A new approach to the design of switching circuits","author":"HA Curtis","year":"1962","unstructured":"Curtis, H.A.: A new approach to the design of switching circuits. van Nostrand Princeton, NJ (1962)"},{"issue":"2","key":"14_CR11","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1147\/rd.312.0187","volume":"31","author":"RK Brayton","year":"1987","unstructured":"Brayton, R.K.: Factoring logic functions. IBM Journal of Research and Development 31(2), 187\u2013198 (1987)","journal-title":"IBM Journal of Research and Development"},{"key":"14_CR12","unstructured":"Sasao, T., Matsuura, M.: DECOMPOS: an integrated system for functional decomposition. In: Int\u2019l Workshop on Logic Synthesis, pp. 471\u2013477 (1998)"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Mishchenko, A., Brayton, R.K., Chatterjee, S.: Boolean factoring and decomposition of logic networks. In: Int\u2019l Conf. on Computer-Aided Design, pp. 38\u201344 (2008)","DOI":"10.1109\/ICCAD.2008.4681549"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Mishchenko, A., Steinbach, B., Perkowski, M.A.: An algorithm for bi-decomposition of logic functions. In: Design Automation Conference, pp. 103\u2013108 (2001)","DOI":"10.1145\/378239.378353"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Bertacco, V., Damiani, M.: The disjunctive decomposition of logic functions. In: Int\u2019l Conf. on Computer-Aided Design, pp. 78\u201382 (1997)","DOI":"10.1109\/ICCAD.1997.643371"},{"issue":"7","key":"14_CR16","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1109\/TCAD.2002.1013899","volume":"21","author":"C Yang","year":"2002","unstructured":"Yang, C., Ciesielski, M.J.: BDS: a BDD-based logic optimization system. IEEE Trans. on CAD of Integrated Circuits and Systems 21(7), 866\u2013876 (2002)","journal-title":"IEEE Trans. on CAD of Integrated Circuits and Systems"},{"issue":"6","key":"14_CR17","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.ipl.2014.01.003","volume":"114","author":"N Abdessaied","year":"2014","unstructured":"Abdessaied, N., Soeken, M., Thomsen, M.K., Drechsler, R.: Upper bounds for reversible circuits based on Young subgroups. Information Processing Letters 114(6), 282\u2013286 (2014)","journal-title":"Information Processing Letters"},{"issue":"16","key":"14_CR18","doi-asserted-by":"publisher","first-page":"3555","DOI":"10.1088\/0305-4470\/38\/16\/007","volume":"38","author":"Y Van Rentergem","year":"2005","unstructured":"Van Rentergem, Y., De Vos, A., Storme, L.: Implementing an arbitrary reversible logic gate. Journal of Physics A: Mathematical and General 38(16), 3555\u20133577 (2005)","journal-title":"Journal of Physics A: Mathematical and General"},{"key":"14_CR19","unstructured":"Soeken, M., Frehse, S., Wille, R., Drechsler, R.: RevKit: A toolkit for reversible circuit design. Journal of Multiple-Valued Logic & Soft Computing 18(1) (2012). RevKit is available at http:\/\/www.revkit.org"},{"issue":"4","key":"14_CR20","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/605440.605442","volume":"7","author":"N Vemuri","year":"2002","unstructured":"Vemuri, N., Kalla, P., Tessier, R.: BDD-based logic synthesis for LUT-based FPGAs. ACM Trans. Design Autom. Electr. Syst. 7(4), 501\u2013525 (2002)","journal-title":"ACM Trans. Design Autom. Electr. Syst."},{"key":"14_CR21","unstructured":"Mishchenko, A., Perkowski, M.: Fast heuristic minimization of exclusive-sums-of-products. In: Int\u2019l Workshop on Applications of the Reed-Muller Expansion in Circuit Design, pp. 242\u2013250 (2001)"}],"container-title":["Lecture Notes in Computer Science","Reversible Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20860-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T02:20:10Z","timestamp":1676946010000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-20860-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319208596","9783319208602"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20860-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}