{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:41:26Z","timestamp":1743032486558,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319171418"},{"type":"electronic","value":"9783319171425"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","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":[[2015]]},"DOI":"10.1007\/978-3-319-17142-5_28","type":"book-chapter","created":{"date-parts":[[2015,4,15]],"date-time":"2015-04-15T11:19:29Z","timestamp":1429096769000},"page":"324-331","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Quantum Circuits for the Unitary\u00a0Permutation\u00a0Problem"],"prefix":"10.1007","author":[{"given":"Stefano","family":"Facchini","sequence":"first","affiliation":[]},{"given":"Simon","family":"Perdrix","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,16]]},"reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0012-365X(74)90116-2","volume":"10","author":"L Adleman","year":"1974","unstructured":"Adleman, L.: Short permutation strings. Discrete Math. 10, 197 (1974)","journal-title":"Short permutation strings. Discrete Math."},{"key":"28_CR2","volume-title":"Mathematical Theory of Connecting Networks and Telephone Traffic.","author":"V Bene\u0161","year":"1965","unstructured":"Bene\u0161, V.: Mathematical Theory of Connecting Networks and Telephone Traffic. Academic Press, New York (1965)"},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1142\/S0129626497000292","volume":"7","author":"C Chang","year":"1997","unstructured":"Chang, C., Melhem, R.: Arbitrary size benes networks. Parallel Process. Lett. 7, 279\u2013284 (1997)","journal-title":"Parallel Process. Lett."},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"022318","DOI":"10.1103\/PhysRevA.88.022318","volume":"88","author":"G Chiribella","year":"2013","unstructured":"Chiribella, G., D\u2019Ariano, G.M., Perinotti, P., Valiron, B.: Quantum computations without definite causal structure. Phys. Rev. A 88, 022318 (2013)","journal-title":"Phys. Rev. A"},{"key":"28_CR5","unstructured":"Chv\u00e1tal, V., Klarner, D.A., Knuth, D.E.: Selected combinatorial research problems. Technical report 292 (1972)"},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"2940","DOI":"10.1016\/j.physleta.2012.08.028","volume":"376","author":"T Colnaghi","year":"2012","unstructured":"Colnaghi, T., D\u2019Ariano, G.M., Facchini, S., Perinotti, P.: Quantum computation with programmable connections between gates. Phys. Lett. A 376, 2940 (2012)","journal-title":"Phys. Lett. A"},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0130040","volume":"30","author":"G Galbiati","year":"1976","unstructured":"Galbiati, G., Preparata, F.P.: On permutation embedding sequences. SIAM J. Appl. Math. 30, 421 (1976)","journal-title":"SIAM J. Appl. Math."},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0097-3165(76)90057-1","volume":"21","author":"D Kleitman","year":"1976","unstructured":"Kleitman, D., Kwiatkowsky, D.: A lower bound on the length of a sequence containing all permutations as subsequences. J. Comb. Theory Ser. A 21, 129 (1976)","journal-title":"J. Comb. Theory Ser. A"},{"key":"28_CR9","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0012-365X(80)90177-6","volume":"31","author":"SP Mohanty","year":"1980","unstructured":"Mohanty, S.P.: Shortest string containing all permutations. Discrete Math. 31, 91 (1980)","journal-title":"Discrete Math."},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1109\/TC.1981.1675791","volume":"30","author":"D Nassimi","year":"1981","unstructured":"Nassimi, D., Sahni, S.: A self-routing benes network and parallel permutation algorithms. IEEE Trans. Comput. 30, 332 (1981)","journal-title":"IEEE Trans. Comput."},{"key":"28_CR11","unstructured":"Newey, M.: Notes on a problem involving permutations as subsequences. Technical report 340 (1973)"},{"key":"28_CR12","doi-asserted-by":"crossref","first-page":"31","DOI":"10.37236\/2859","volume":"19","author":"S Radomirovi\u0107","year":"2012","unstructured":"Radomirovi\u0107, S.: A construction of short sequences containing all permutations of a set as subsequences. Electron. J. Comb. 19, 31 (2012)","journal-title":"Electron. J. Comb."},{"key":"28_CR13","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0012-365X(82)90224-2","volume":"42","author":"C Savage","year":"1982","unstructured":"Savage, C.: Short strings containing all k-element permutations. Discrete Math. 42, 281 (1982)","journal-title":"Discrete Math."},{"key":"28_CR14","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1145\/321439.321449","volume":"15","author":"A Waksman","year":"1968","unstructured":"Waksman, A.: A permutation network. J. Ass. Comput. Mach. 15, 159 (1968)","journal-title":"J. Ass. Comput. Mach."},{"key":"28_CR15","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1016\/j.ipl.2011.03.018","volume":"111","author":"E Z\u0103linescu","year":"2011","unstructured":"Z\u0103linescu, E.: Shorter strings containing all k-element permutations. Inf. Process. Lett. 111, 605 (2011)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-17142-5_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T00:37:47Z","timestamp":1676939867000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-17142-5_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319171418","9783319171425"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-17142-5_28","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":"16 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}