{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T05:04:26Z","timestamp":1740287066567,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642135224"},{"type":"electronic","value":"9783642135231"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13523-1_16","type":"book-chapter","created":{"date-parts":[[2010,6,23]],"date-time":"2010-06-23T04:34:26Z","timestamp":1277267666000},"page":"140-151","source":"Crossref","is-referenced-by-count":2,"title":["Quantum Query Algorithms for Conjunctions"],"prefix":"10.1007","author":[{"given":"Alina","family":"Vasilieva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taisia","family":"Mischenko-Slatenkova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"16_CR1","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P.W. Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing\u00a026(5), 1484\u20131509 (1997)","journal-title":"SIAM Journal on Computing"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Grover, L.: A fast quantum mechanical algorithm for database search. In: Proceedings of 28th STOC 1996, pp. 212\u2013219 (1996)","DOI":"10.1145\/237814.237866"},{"key":"16_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04978-5","volume-title":"Information and Randomness: an Algorithmic Perspective","author":"C.S. Calude","year":"2002","unstructured":"Calude, C.S.: Information and Randomness: an Algorithmic Perspective, 2nd edn. Springer, Heidelberg (2002)","edition":"2"},{"issue":"1-2","key":"16_CR4","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1023\/A:1019623616675","volume":"1","author":"C.S. Calude","year":"2002","unstructured":"Calude, C.S., Pavlov, B.: Coins, quantum measurements and Turing\u2019s barrier. Quantum Information Processing\u00a01(1-2), 107\u2013127 (2002)","journal-title":"Quantum Information Processing"},{"issue":"11","key":"16_CR5","doi-asserted-by":"publisher","first-page":"1718","DOI":"10.1016\/j.ic.2006.07.003","volume":"204","author":"C.S. Calude","year":"2006","unstructured":"Calude, C.S., Stay, M.A.: Natural halting probabilities, partial randomness and zeta functions. Information and Computation\u00a0204(11), 1718\u20131739 (2006)","journal-title":"Information and Computation"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/BFb0019368","volume-title":"Baltic Computer Science","author":"R. Freivalds","year":"1991","unstructured":"Freivalds, R.: Complexity of Probabilistic Versus Deterministic Automata. In: Barzdins, J., Bjorner, D. (eds.) Baltic Computer Science. LNCS, vol.\u00a0502, pp. 565\u2013613. Springer, Heidelberg (1991)"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Freivalds, R.: 1-Way Quantum Finite Automata: Strengths, Weaknesses and Generalizations. In: FOCS, pp. 332\u2013341 (1998)","DOI":"10.1109\/SFCS.1998.743469"},{"issue":"1","key":"16_CR8","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.tcs.2008.01.041","volume":"395","author":"K. Morita","year":"2008","unstructured":"Morita, K.: Reversible computing and cellular automata - A survey. Theoretical Computer Science\u00a0395(1), 101\u2013131 (2008)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"16_CR9","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0304-3975(01)00144-X","volume":"288","author":"H. Buhrman","year":"2002","unstructured":"Buhrman, H., de Wolf, R.: Complexity Measures and Decision Tree Complexity: A Survey. Theoretical Computer Science\u00a0288(1), 21\u201343 (2002)","journal-title":"Theoretical Computer Science"},{"key":"16_CR10","unstructured":"de Wolf, R.: Quantum Computing and Communication Complexity. University of Amsterdam (2001)"},{"key":"16_CR11","volume-title":"Quantum Computation and Quantum Information","author":"M. Nielsen","year":"2000","unstructured":"Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Kaye, R., Laflamme, R., Mosca, M.: An Introduction to Quantum Computing, Oxford (2007)","DOI":"10.1093\/oso\/9780198570004.001.0001"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Ambainis, A.: Quantum query algorithms and lower bounds (survey article). In: Proceedings of FOTFS III, Trends on Logic, vol.\u00a023, pp. 15\u201332 (2004)","DOI":"10.1007\/978-1-4020-2776-5_2"},{"key":"16_CR14","unstructured":"Lace, L.: Doctoral Thesis. University of Latvia (2008)"},{"key":"16_CR15","unstructured":"Vasilieva, A.: Quantum Query Algorithms for AND and OR Boolean Functions, Logic and Theory of Algorithms. In: Proceedings of Fourth Conference on Computability in Europe, pp. 453\u2013462 (2008)"}],"container-title":["Lecture Notes in Computer Science","Unconventional Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13523-1_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T05:14:21Z","timestamp":1740201261000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13523-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642135224","9783642135231"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13523-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}