{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T23:40:03Z","timestamp":1748994003537,"version":"3.41.0"},"publisher-location":"Cham","reference-count":20,"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_22","type":"book-chapter","created":{"date-parts":[[2016,6,29]],"date-time":"2016-06-29T20:25:20Z","timestamp":1467231920000},"page":"307-321","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["A Fast Symbolic Transformation Based Algorithm for Reversible Logic Synthesis"],"prefix":"10.1007","author":[{"given":"Mathias","family":"Soeken","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard W.","family":"Dueck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. Michael","family":"Miller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,30]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Alhagi, N., Hawash, M., Perkowski, M.A.: Synthesis of reversible circuits with no ancilla bits for large reversible functions specified with bit equations. In: ISMVL, pp. 39\u201345 (2010)","key":"22_CR1","DOI":"10.1109\/ISMVL.2010.16"},{"volume-title":"Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications","year":"2009","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, vol. 185. IOS Press, Amsterdam (2009)","key":"22_CR2"},{"issue":"8","key":"22_CR3","first-page":"677","volume":"35","author":"RE Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE-TC 35(8), 677\u2013691 (1986)","journal-title":"IEEE-TC"},{"issue":"2","key":"22_CR4","doi-asserted-by":"publisher","first-page":"183","DOI":"10.3934\/amc.2008.2.183","volume":"2","author":"A Vos De","year":"2008","unstructured":"De Vos, A., Rentergem, Y.: Young subgroups for reversible computers. Adv. Math. Commun. 2(2), 183\u2013200 (2008)","journal-title":"Adv. Math. Commun."},{"unstructured":"E\u00e9n, N., Mishchenko, A., Amla, N.: A single-instance incremental SAT formulation of proof- and counterexample-based abstraction. In: FMCAD, pp. 181\u2013188 (2010)","key":"22_CR5"},{"issue":"5","key":"22_CR6","first-page":"703","volume":"28","author":"D Gro\u00dfe","year":"2009","unstructured":"Gro\u00dfe, D., Wille, R., Dueck, G.W., Drechsler, R.: Exact multiple-control Toffoli network synthesis with SAT techniques. TCAD 28(5), 703\u2013715 (2009)","journal-title":"TCAD"},{"issue":"11","key":"22_CR7","first-page":"2317","volume":"25","author":"P Gupta","year":"2006","unstructured":"Gupta, P., Agrawal, A., Jha, N.K.: An algorithm for synthesis of reversible logic circuits. TCAD 25(11), 2317\u20132330 (2006)","journal-title":"TCAD"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-642-12002-2_10","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M J\u00e4rvisalo","year":"2010","unstructured":"J\u00e4rvisalo, M., Biere, A., Heule, M.: Blocked clause elimination. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 129\u2013144. Springer, Heidelberg (2010)"},{"doi-asserted-by":"crossref","unstructured":"Miller, D.M., Maslov, D., Dueck, G.W.: A transformation based algorithm for reversible logic synthesis. In: DAC, pp. 318\u2013323 (2003)","key":"22_CR9","DOI":"10.1145\/775832.775915"},{"issue":"3","key":"22_CR10","first-page":"293","volume":"2","author":"DA Plaisted","year":"1986","unstructured":"Plaisted, D.A., Greenbaum, S.: A structure-preserving clause form translation. JSC 2(3), 293\u2013394 (1986)","journal-title":"JSC"},{"doi-asserted-by":"crossref","unstructured":"Sinz, C.: Towards an optimal CNF encoding of boolean cardinality constraints. In: CP, pp. 827\u2013831 (2005)","key":"22_CR11","DOI":"10.1007\/11564751_73"},{"doi-asserted-by":"crossref","unstructured":"Soeken, M., Chattopadhyay, A.: Fredkin-enabled transformation-based reversible logic synthesis. In: ISMVL, pp. 60\u201365 (2015)","key":"22_CR12","DOI":"10.1109\/ISMVL.2015.37"},{"issue":"1","key":"22_CR13","first-page":"55","volume":"18","author":"M Soeken","year":"2012","unstructured":"Soeken, M., Frehse, S., Wille, R., Drechsler, R.: RevKit: a toolkit for reversible circuit design. Multiple-Valued Logic Soft Comput. 18(1), 55\u201365 (2012)","journal-title":"Multiple-Valued Logic Soft Comput."},{"key":"22_CR14","first-page":"1","volume":"73","author":"M Soeken","year":"2016","unstructured":"Soeken, M., Tague, L., Dueck, G.W., Drechsler, R.: Ancilla-free synthesis of large reversible functions using binary decision diagrams. JSC 73, 1\u201326 (2016)","journal-title":"JSC"},{"doi-asserted-by":"crossref","unstructured":"Soeken, M., Wille, R., Hilken, C., Przigoda, N., Drechsler, R.: Synthesis of reversible circuits with minimal lines for large functions. In: ASP-DAC, pp. 85\u201392 (2012)","key":"22_CR15","DOI":"10.1109\/ASPDAC.2012.6165069"},{"unstructured":"Soeken, M., Wille, R., Keszocze, O., Miller, D.M., Drechsler, R.: Embedding of large Boolean functions for reversible logic. JETC (2015). arXiv:1408.3586","key":"22_CR16"},{"issue":"9&10","key":"22_CR17","first-page":"872","volume":"10","author":"Y Takahashi","year":"2010","unstructured":"Takahashi, Y., Tani, S., Kunihiro, N.: Quantum addition circuits and unbounded fan-out. Quantum Inf. Comput. 10(9&10), 872\u2013890 (2010)","journal-title":"Quantum Inf. Comput."},{"doi-asserted-by":"crossref","unstructured":"Touati, H.J., Savoj, H., Lin, B., Brayton, R.K., Sangiovanni-Vincentelli, A.L.: Implicit state enumeration of finite state machines using BDDs. In: ICCAD, pp. 130\u2013133 (1990)","key":"22_CR18","DOI":"10.1109\/ICCAD.1990.129860"},{"issue":"11","key":"22_CR19","doi-asserted-by":"publisher","first-page":"1262","DOI":"10.1109\/12.324559","volume":"43","author":"I Wegener","year":"1994","unstructured":"Wegener, I.: The size of reduced OBDDs and optimal read-once branching programs for almost all Boolean functions. IEEE Trans. Comput. 43(11), 1262\u20131269 (1994)","journal-title":"IEEE Trans. Comput."},{"doi-asserted-by":"crossref","unstructured":"Wille, R., Gro\u00dfe, D., Dueck, G.W., Drechsler, R.: Reversible logic synthesis with output permutation. In: VLSI Design, pp. 189\u2013194 (2009)","key":"22_CR20","DOI":"10.1109\/VLSI.Design.2009.40"}],"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_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T23:14:58Z","timestamp":1748992498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40578-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319405773","9783319405780"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40578-0_22","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"}}]}}