{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:42:38Z","timestamp":1743018158782,"version":"3.40.3"},"publisher-location":"Cham","reference-count":4,"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_20","type":"book-chapter","created":{"date-parts":[[2016,6,29]],"date-time":"2016-06-29T16:25:20Z","timestamp":1467217520000},"page":"271-285","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Finite Alternation Result for Reversible Boolean Circuits"],"prefix":"10.1007","author":[{"given":"Peter","family":"Selinger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,30]]},"reference":[{"issue":"33","key":"20_CR1","doi-asserted-by":"publisher","first-page":"7063","DOI":"10.1088\/0305-4470\/35\/33\/307","volume":"35","author":"A Vos De","year":"2002","unstructured":"De Vos, A., Raa, B., Storme, L.: Generating the group of reversible logic gates. J. Phys. A 35(33), 7063 (2002)","journal-title":"J. Phys. A"},{"key":"20_CR2","unstructured":"Musset, J.: G\u00e9n\u00e9rateurs et relations pour les circuits bool\u00e9ens r\u00e9versibles. Technical report 97\u201332, Institut de Math\u00e9matiques de Luminy (1997). \n                      http:\/\/iml.univ-mrs.fr\/editions\/"},{"key":"20_CR3","unstructured":"Saeedi, M., Markov, I.L.: Synthesis and optimization of reversible circuits \u2013 a survey. ACM Comput. Surv. 45(2), 34 p. (2013). \n                      arXiv:1110.2574"},{"key":"20_CR4","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., van Leeuwen, J. (eds.) Automata, Languages and Programming. LNCS, vol. 85, pp. 632\u2013644. Springer, Heidelberg (1980). Abridged version of Technical Memo MIT\/LCS\/TM-151, MIT Lab. for Comput. Sci. (1980)"}],"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_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T00:44:27Z","timestamp":1558313067000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40578-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319405773","9783319405780"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40578-0_20","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"}}]}}