{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T05:27:01Z","timestamp":1706765221973},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,6,1]],"date-time":"2011-06-01T00:00:00Z","timestamp":1306886400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artif Life Robotics"],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1007\/s10015-011-0900-5","type":"journal-article","created":{"date-parts":[[2011,6,28]],"date-time":"2011-06-28T05:51:26Z","timestamp":1309240286000},"page":"107-111","source":"Crossref","is-referenced-by-count":1,"title":["Study on discrete adiabatic quantum computation in 3-SAT problems"],"prefix":"10.1007","volume":"16","author":[{"given":"Mohamed","family":"El-fiky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satoshi","family":"Ono","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shigeru","family":"Nakayama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,6,29]]},"reference":[{"key":"900_CR1","unstructured":"Shor P (1997) Polynomial-time algorithms for prime factorization on a quantum computer. SIAM J Comput 26"},{"key":"900_CR2","first-page":"212","volume-title":"ACM Symposium on Theory of Computing","author":"L. Grover","year":"1996","unstructured":"Grover L (1996) Fast quantum mechanical algorithm for database search. ACM Symposium on Theory of Computing, ACM Press, New York, pp 212\u2013219"},{"key":"900_CR3","unstructured":"Hogg T (2004) Adiabatic quantum computing for random satisfiability problems. quant-ph\/0206059"},{"key":"900_CR4","unstructured":"Farhi E, Goldstone J, Gutmann S, et al (2000) Quantum computation by adiabatic evolution. quant-ph\/0001106"},{"key":"900_CR5","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1126\/science.1057726","volume":"292","author":"E. Farhi","year":"2001","unstructured":"Farhi E (2001) A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem. Science 292:472\u2013476","journal-title":"Science"},{"key":"900_CR6","unstructured":"Smelyanskiy VN, Timucin DA (2002) Simulations of the adiabatic quantum optimization for the set partition problem. Los Alamos preprint quant-ph\/0112143"},{"key":"900_CR7","volume-title":"Computers and intractability: a guide to the theory of np-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of np-completeness. Freeman, San Francisco"},{"key":"900_CR8","doi-asserted-by":"crossref","first-page":"1297","DOI":"10.1126\/science.264.5163.1297","volume":"264","author":"S. Kirkpatrick","year":"1994","unstructured":"Kirkpatrick S, Selman B (1994) Critical behavior in the satisfiability of random Boolean expressions. Science 264:1297\u20131301","journal-title":"Science"},{"key":"900_CR9","doi-asserted-by":"crossref","unstructured":"Das S, Kobes R, Kunstatter G (2003) Energy and efficiency of adiabatic quantum search algorithms. quant-ph\/0204044v4; Phys Rev A 57","DOI":"10.1088\/0305-4470\/36\/11\/313"},{"key":"900_CR10","doi-asserted-by":"crossref","unstructured":"van Dam W, Mosca M, Vazirani U (2002) How powerful is adiabatic quantum computation? quant-ph\/0206003 v1","DOI":"10.1109\/SFCS.2001.959902"}],"container-title":["Artificial Life and Robotics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10015-011-0900-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10015-011-0900-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10015-011-0900-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T08:53:19Z","timestamp":1560329599000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10015-011-0900-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["900"],"URL":"https:\/\/doi.org\/10.1007\/s10015-011-0900-5","relation":{},"ISSN":["1433-5298","1614-7456"],"issn-type":[{"value":"1433-5298","type":"print"},{"value":"1614-7456","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6]]}}}