{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T01:17:45Z","timestamp":1780535865721,"version":"3.54.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,7,26]],"date-time":"2014-07-26T00:00:00Z","timestamp":1406332800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1007\/s11047-014-9438-5","type":"journal-article","created":{"date-parts":[[2014,7,25]],"date-time":"2014-07-25T09:24:46Z","timestamp":1406280286000},"page":"485-490","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":35,"title":["Logic circuits from zero forcing"],"prefix":"10.1007","volume":"14","author":[{"given":"Daniel","family":"Burgarth","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vittorio","family":"Giovannetti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Leslie","family":"Hogben","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Simone","family":"Severini","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Young","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,7,26]]},"reference":[{"key":"9438_CR1","unstructured":"Aazami A (2008) Hardness results and approximation algorithms for some problems on graphs. Ph.D. thesis, University of Waterloo"},{"key":"9438_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579196","volume":"7","author":"N Alon","year":"1986","unstructured":"Alon N, Boppana R (1986) The monotone circuit complexity of Boolean functions. Combinatorica 7:1\u201322","journal-title":"Combinatorica"},{"key":"9438_CR3","doi-asserted-by":"crossref","first-page":"1628","DOI":"10.1016\/j.laa.2007.10.009","volume":"428","author":"F Barioli","year":"2008","unstructured":"American Institute of Mathematics (AIM) Minimum Rank-Special GraphsWork Group, Barioli F, Barrett W, Butler S, Cioab\u0103 SM, Cvetkovi\u0107 D, Fallat SM, Godsil C, Haemers W, Hogben L, Mikkelson R, Narayan S, Pryporova O, Sciriha I, So W, Stevanovi\u0107 D, van der Holst H, Vander Meulen K, Wangsness A (2008) Zero forcing sets and the minimum rank of graphs. Linear Algebra Appl 428:1628\u20131648","journal-title":"Linear Algebra Appl"},{"key":"9438_CR4","first-page":"181","volume":"61","author":"J Astola","year":"1997","unstructured":"Astola J, Akopian D, Vainio O, Agaian S (1997) New digit-serial implementation of stack filters. Discrete Appl Math 61:181\u2013197","journal-title":"Discrete Appl Math"},{"key":"9438_CR6","doi-asserted-by":"crossref","unstructured":"Burgarth D, Giovannetti V (2007) Full control by locally induced relaxation. Phys Rev Lett 99:100501. arXiv:0704.3027 [quant-ph]","DOI":"10.1103\/PhysRevLett.99.100501"},{"key":"9438_CR5","doi-asserted-by":"crossref","unstructured":"Burgarth D, Bose S, Bruder C, Giovannetti V (2009) Local controllability of quantum networks. Phys Rev A 79:060305(R). arXiv:0805.3975 [quant-ph]","DOI":"10.1103\/PhysRevA.79.060305"},{"key":"9438_CR7","doi-asserted-by":"crossref","unstructured":"Burgarth D, D\u2019Alessandro D, Hogben L, Severini S, Young M (2013) Zero forcing, linear and quantum controllability for systems evolving on networks. IEEE Trans Automat Contr 99(9):2349\u20132354. arXiv:1111.1475v1 [quant-ph]","DOI":"10.1109\/TAC.2013.2250075"},{"issue":"1","key":"9438_CR8","doi-asserted-by":"crossref","first-page":"148","DOI":"10.3390\/a5010148","volume":"5","author":"ED Demaine","year":"2012","unstructured":"Demaine ED, Demaine ML, Uehara R (2012) Any monotone function is realized by interlocked polygons. Algorithms (Basel) 5(1):148\u2013157","journal-title":"Algorithms (Basel)"},{"key":"9438_CR9","doi-asserted-by":"crossref","unstructured":"Drechsler R, Wille R (2011) From truth tables to programming languages: progress in the design of reversible circuits. In: ISMVL11 Proceedings of the 2011 41st IEEE International Symposium on Multiple-Valued Logic, pp 78\u201385","DOI":"10.1109\/ISMVL.2011.40"},{"issue":"3","key":"9438_CR10","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF01857727","volume":"21","author":"E Fredkin","year":"1982","unstructured":"Fredkin E, Toffoli T (1982) Conservative logic. Int J Theor Phys 21(3):219\u2013253","journal-title":"Int J Theor Phys"},{"key":"9438_CR11","volume-title":"Handbook of theoretical computer science","author":"J Leeuwen","year":"1990","unstructured":"Leeuwen J (1990) Handbook of theoretical computer science. Elsevier, Amsterdam"},{"key":"9438_CR12","first-page":"354","volume":"31","author":"AA Razborov","year":"1985","unstructured":"Razborov AA (1985) Lower bounds for the monotone complexity of some Boolean functions. Soviet Math Dokl 31:354\u2013357","journal-title":"Soviet Math Dokl"},{"key":"9438_CR13","first-page":"87","volume":"35","author":"NP Red\u2019kin","year":"1979","unstructured":"Red\u2019kin NP (1979) On the realization of monotone boolean functions by contact circuits. Probl Kibern 35:87\u2013110","journal-title":"Probl Kibern"},{"key":"9438_CR14","doi-asserted-by":"crossref","unstructured":"Saeedi M, Markov IL (2013) Synthesis and optimization of reversible circuits\u2014 a survey, ACM computing surveys. 45, 2, Article 21 pp 34. arXiv:1110.2574 [cs.ET]","DOI":"10.1145\/2431211.2431220"},{"key":"9438_CR15","doi-asserted-by":"crossref","unstructured":"Severini S (2008) Nondiscriminatory propagation on trees. J Phys A Math Theor 41:482002. arXiv:0805.0181 [math.CO]","DOI":"10.1088\/1751-8113\/41\/48\/482002"},{"key":"9438_CR17","doi-asserted-by":"crossref","unstructured":"Toffoli T (1980) Reversible computing. Technical Report MIT\/LCS\/TM-151","DOI":"10.1007\/3-540-10003-2_104"},{"key":"9438_CR16","doi-asserted-by":"crossref","unstructured":"Vitanyi P (2005) Time, space, and energy in reversible computing. In: Proceedings of ACM International Conference on Computing Frontiers, Ischia, Italy, pp 4\u20136, May 2005, 1st International Workshop on Reversible Computing","DOI":"10.1145\/1062261.1062335"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-014-9438-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-014-9438-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-014-9438-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,13]],"date-time":"2019-08-13T01:34:03Z","timestamp":1565660043000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-014-9438-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,26]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["9438"],"URL":"https:\/\/doi.org\/10.1007\/s11047-014-9438-5","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,26]]}}}