{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:51:19Z","timestamp":1725486679263},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540729136"},{"type":"electronic","value":"9783540729143"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72914-3_5","type":"book-chapter","created":{"date-parts":[[2007,6,26]],"date-time":"2007-06-26T05:37:26Z","timestamp":1182836246000},"page":"30-39","source":"Crossref","is-referenced-by-count":5,"title":["HIROIMONO Is NP-Complete"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Andersson","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","volume-title":"The greatest puzzles of all time","author":"M.J. Costello","year":"1988","unstructured":"Costello, M.J.: The greatest puzzles of all time. Prentice-Hall, Englewood Cliffs (1988)"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/3-540-45071-8_36","volume-title":"Computing and Combinatorics","author":"E.D. Demaine","year":"2003","unstructured":"Demaine, E.D., Hohenberger, S., Liben-Nowell, D.: Tetris is hard, even to approximate. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol.\u00a02697, pp. 351\u2013363. Springer, Heidelberg (2003)"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF03025367","volume":"22","author":"R. Kaye","year":"2000","unstructured":"Kaye, R.: Minesweeper is NP-complete. Mathematical Intelligencer\u00a022, 9\u201315 (2000)","journal-title":"Mathematical Intelligencer"},{"key":"5_CR4","unstructured":"Culberson, J.: Sokoban is PSPACE-complete. In: Proceedings of the International Conference on Fun with Algorithms, Carleton Scientific, pp. 65\u201376 (1998)"},{"key":"5_CR5","first-page":"1052","volume":"86","author":"T. Yato","year":"2003","unstructured":"Yato, T., Seta, T.: Complexity and completeness of finding another solution and its application to puzzles. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences\u00a086, 1052\u20131060 (2003)","journal-title":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"},{"key":"5_CR6","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Co, New York (1979)"},{"key":"5_CR7","unstructured":"Andersson, D.: Reduce 3-SAT to HIROIMONO, \n                  \n                    http:\/\/purl.org\/net\/koda\/s2h.php"}],"container-title":["Lecture Notes in Computer Science","Fun with Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72914-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T09:53:39Z","timestamp":1558259619000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72914-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540729136","9783540729143"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72914-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}