{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,5]],"date-time":"2023-03-05T05:10:57Z","timestamp":1677993057005},"reference-count":7,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2023,3,1]]},"DOI":"10.1587\/transinf.2022fcl0002","type":"journal-article","created":{"date-parts":[[2023,2,28]],"date-time":"2023-02-28T22:20:17Z","timestamp":1677622817000},"page":"328-332","source":"Crossref","is-referenced-by-count":0,"title":["Calculation Solitaire is NP-Complete"],"prefix":"10.1587","volume":"E106.D","author":[{"given":"Chuzo","family":"IWAMOTO","sequence":"first","affiliation":[{"name":"Graduate School of Advanced Science and Engineering, Hiroshima University"}]},{"given":"Tatsuya","family":"IDE","sequence":"additional","affiliation":[{"name":"Graduate School of Advanced Science and Engineering, Hiroshima University"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] https:\/\/en.wikipedia.org\/wiki\/Calculation_(card_game)"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] F. Arena and M.D. Ianni, \u201cComplexity of Scorpion Solitaire and applications to Klondike,\u201d Theor. Compt. Sci., vol.890, pp.105-124, 2022. DOI: 10.1016\/j.tcs.2021.08.019 10.1016\/j.tcs.2021.08.019","DOI":"10.1016\/j.tcs.2021.08.019"},{"key":"3","unstructured":"[3] P.M. Tchebichef, \u201cM\u00e9moire sur les nombres premiers,\u201d Journal de math\u00e9matiques pures et appliqu\u00e9es, S\u00e9rie 1 (in French), pp.366-390, 1852."},{"key":"4","unstructured":"[4] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, 1979."},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] M. Helmert, \u201cComplexity results for standard benchmark domains in planning,\u201d Artificial Intelligence, vol.143, no.2, pp.219-262, 2003. DOI: 10.1016\/S0004-3702(02)00364-8 10.1016\/s0004-3702(02)00364-8","DOI":"10.1016\/S0004-3702(02)00364-8"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] L. Longpr\u00e9 and P. McKenzie, \u201cThe complexity of Solitaire,\u201d Theor. Compt. Sci., vol.410, no.50, pp.5252-5260, 2009. DOI: 10.1016\/j.tcs.2009.08.027 10.1016\/j.tcs.2009.08.027","DOI":"10.1016\/j.tcs.2009.08.027"},{"key":"7","unstructured":"[7] J. Stern, \u201cSpider Solitaire is NP-complete,\u201d arXiv:1110.1052v1 [cs.CC], 7 pages, 2011."}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E106.D\/3\/E106.D_2022FCL0002\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,4]],"date-time":"2023-03-04T04:15:44Z","timestamp":1677903344000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E106.D\/3\/E106.D_2022FCL0002\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,1]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2022fcl0002","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,1]]},"article-number":"2022FCL0002"}}