{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:30:14Z","timestamp":1742956214814,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440406"},{"type":"electronic","value":"9783540456872"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45687-2_7","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T08:57:47Z","timestamp":1192784267000},"page":"93-103","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Finite Domain Constraint Satisfaction Using Quantum Computation"],"prefix":"10.1007","author":[{"given":"Ola","family":"Angelsmark","sequence":"first","affiliation":[]},{"given":"Vilhelm","family":"Dahll\u00f6f","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Jonsson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,10,4]]},"reference":[{"issue":"4","key":"7_CR1","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1023\/A:1011402324562","volume":"6","author":"D. Achlioptas","year":"2001","unstructured":"D. Achlioptas, L. M. Kirousis, E. Kranakis, D. Krizanc, M. Molloy, and Y. Stamatiou. Random constraint satisfaction: A more accurate picture. Constraints, 6(4):329\u2013344, 2001.","journal-title":"Constraints"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","volume":"8","author":"B. Aspvall","year":"1979","unstructured":"B. Aspvall, M. F. Plass, and R. E. Tarjan. A linear time algorithm for testing the truth of certain quantified Boolean formulas. Inf. Process. Lett., 8:121\u2013123, 1979.","journal-title":"Inf. Process. Lett."},{"key":"7_CR3","unstructured":"R. Beigel and D. Eppstein. 3-coloring in time O(1.3289n). ACM Computing Research Repository, June 2000."},{"key":"7_CR4","unstructured":"M. Boyer, G. Brassard, P. H\u00f8yer, and A. Tapp. Tight bounds on quantum searching. In Proc. 4th Workshop on Physics and Computation, pages 36\u201343, 1996."},{"issue":"4\/5","key":"7_CR5","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s002000050134","volume":"10","author":"N. J. Cerf","year":"2000","unstructured":"N. J. Cerf, L. K. Grover, and C. P. Williams. Nested quantum search and NP-hard problems. Applicable Algebra in Engineering, Communication and Computing, 10(4\/5):311\u2013338, 2000.","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"key":"7_CR6","unstructured":"D. Eppstein. Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction. In Proc. 12th Annual Symposium on Discrete Algorithms (SODA), pages 329\u2013337, 2001."},{"key":"7_CR7","unstructured":"T. Feder and R. Motwani. Worst-case time bounds for coloring and satisfiability problems. Unpublished manuscript."},{"issue":"1\u20132","key":"7_CR8","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0004-3702(95)00047-X","volume":"81","author":"I. P. Gent","year":"1996","unstructured":"I. P. Gent and T. Walsh. The satisfiability constraint gap. Artificial Intelligence, 81(1\u20132):59\u201380, 1996.","journal-title":"Artificial Intelligence"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"L. K. Grover. A fast quantum mechanical algorithm for database search. In Proc. 28th Annual ACM Symposium on the Theory of Computing (STOC), pages 212\u2013219, 1996.","DOI":"10.1145\/237814.237866"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"S. Micali and V. V. Vazirani. An O(\u21cf|v| \u00b7 |e|) algorithm for finding maximum matching in general graphs. In 21st Annual Symposium on Foundations of Computer Science (FOCS), pages 10\u201316, IEEE Computer Society, 1980.","DOI":"10.1109\/SFCS.1980.12"},{"key":"7_CR11","unstructured":"M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000."},{"issue":"5","key":"7_CR12","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P. W. Shor","year":"1997","unstructured":"P. W. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5):1484\u20131509, 1997.","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2002"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45687-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T20:13:35Z","timestamp":1674072815000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-45687-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440406","9783540456872"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-45687-2_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"4 October 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}