{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,5]],"date-time":"2026-04-05T16:48:11Z","timestamp":1775407691443,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540677871","type":"print"},{"value":"9783540449683","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44968-x_46","type":"book-chapter","created":{"date-parts":[[2007,11,29]],"date-time":"2007-11-29T04:37:43Z","timestamp":1196311063000},"page":"467-476","source":"Crossref","is-referenced-by-count":20,"title":["Ordered Quantum Branching Programs Are More Powerful than Ordered Probabilistic Branching Programs under a Bounded-Width Restriction"],"prefix":"10.1007","author":[{"given":"Masaki","family":"Nakanishi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kiyoharu","family":"Hamaguchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshinobu","family":"Kashiwabara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,7,21]]},"reference":[{"key":"46_CR1","doi-asserted-by":"crossref","unstructured":"A. Ambainis and R. Freivalds, \u201c1-way quantum finite automata: strengths, weakness and generalizations,\u201d Proc. 39th Symp. on Foundations of Computer Science, pp. 332\u2013341, 1998.","DOI":"10.1109\/SFCS.1998.743469"},{"key":"46_CR2","doi-asserted-by":"crossref","unstructured":"L. Grover, \u201cA fast quantum mechanical algorithm for database search,\u201d Proc. 28th Symp. on the Theory of Computing, pp. 212\u2013219, 1996.","DOI":"10.1145\/237814.237866"},{"key":"46_CR3","doi-asserted-by":"crossref","unstructured":"A. Kondacs and J. Watorus, \u201cOn the power of quantum finite state automata,\u201d Proc. 38th Symp. on Foundations of Computer Science, pp. 66\u201375, 1997.","DOI":"10.1109\/SFCS.1997.646094"},{"key":"46_CR4","series-title":"Lect Notes Comput Sci","volume-title":"1989","author":"C. Meinel","year":"1989","unstructured":"C. Meinel, \u201cModified branching programs and their computational power,\u201d Lecture Notes in Computer Science 370, Springer-Verlag, Berlin, 1989."},{"key":"46_CR5","doi-asserted-by":"crossref","unstructured":"P. Shor, \u201cAlgorithms for quantum computation: discrete logarithms and factoring,\u201d Proc. 35th Symp. on Foundations of Computer Science, pp. 124\u2013134, 1994.","DOI":"10.1109\/SFCS.1994.365700"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44968-X_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T18:58:29Z","timestamp":1551121109000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44968-X_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677871","9783540449683"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-44968-x_46","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}