{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:26:54Z","timestamp":1725794814006},"publisher-location":"Cham","reference-count":7,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319078892"},{"type":"electronic","value":"9783319078908"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07890-8_12","type":"book-chapter","created":{"date-parts":[[2014,5,28]],"date-time":"2014-05-28T12:08:51Z","timestamp":1401278931000},"page":"137-146","source":"Crossref","is-referenced-by-count":1,"title":["Playing Dominoes Is Hard, Except by Yourself"],"prefix":"10.1007","author":[{"given":"Erik D.","family":"Demaine","sequence":"first","affiliation":[]},{"given":"Fermi","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Erik","family":"Waingarten","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"Stormdark, I.P., Media: Domino history (2010), \n                  \n                    http:\/\/www.domino-play.com\/History.htm"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.tcs.2013.11.023","volume":"521","author":"E.D. Demaine","year":"2014","unstructured":"Demaine, E.D., Demaine, M.L., Harvey, N.J., Uehara, R., Uno, T., Uno, Y.: Uno is hard, even for a single player. Theoretical Computer Science\u00a0521, 51\u201361 (2014)","journal-title":"Theoretical Computer Science"},{"key":"12_CR3","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"B\u00f3na, M.: A Walk Through Combinatorics: An Introduction to Enumeration and Graph Theory. World Scientific (2011)","DOI":"10.1142\/8027"},{"key":"12_CR5","unstructured":"Sipser, M.: Introduction to the Theory of Computation. PWS Publishing Company (1997)"},{"issue":"2","key":"12_CR6","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1145\/322186.322201","volume":"27","author":"D. Lichtenstein","year":"1980","unstructured":"Lichtenstein, D., Sipser, M.: Go is polynomial-space hard. J. ACM\u00a027(2), 393\u2013401 (1980)","journal-title":"J. ACM"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Hearn, R.A., Demaine, E.D.: Games, Puzzles, and Computation. AK Peters, Limited (2009)","DOI":"10.1201\/b10581"}],"container-title":["Lecture Notes in Computer Science","Fun with Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07890-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T19:15:58Z","timestamp":1558898158000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07890-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319078892","9783319078908"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07890-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}