{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:18:16Z","timestamp":1725891496670},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642303463"},{"type":"electronic","value":"9783642303470"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30347-0_26","type":"book-chapter","created":{"date-parts":[[2012,5,30]],"date-time":"2012-05-30T22:27:55Z","timestamp":1338416875000},"page":"258-269","source":"Crossref","is-referenced-by-count":0,"title":["Scrabble Is PSPACE-Complete"],"prefix":"10.1007","author":[{"given":"Michael","family":"Lampis","sequence":"first","affiliation":[]},{"given":"Valia","family":"Mitsou","sequence":"additional","affiliation":[]},{"given":"Karolina","family":"So\u0142tys","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Hearn, R.A.: Playing games with algorithms: algorithmic combinatorial game theory. In: Games of No Chance III, Proc. BIRS Workshop on Combinatorial Games, pp. 3\u201356. Citeseer (July 2005)","DOI":"10.1017\/CBO9780511807251.002"},{"issue":"2","key":"26_CR2","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0097-3165(81)90016-9","volume":"31","author":"A.S. Fraenkel","year":"1981","unstructured":"Fraenkel, A.S., Lichtenstein, D.: Computing a perfect strategy for n \u00d7 n chess requires time exponential in n. Journal of Combinatorial Theory, Series A\u00a031(2), 199\u2013214 (1981)","journal-title":"Journal of Combinatorial Theory, Series A"},{"issue":"2","key":"26_CR3","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0304-3975(94)90131-7","volume":"123","author":"S. Iwata","year":"1994","unstructured":"Iwata, S., Kasai, T.: The othello game on an n \u00d7 n board is pspace-complete. Theoretical Computer Science\u00a0123(2), 329\u2013340 (1994)","journal-title":"Theoretical Computer Science"},{"key":"26_CR4","unstructured":"Papadimitriou, C.H.: Computational complexity (1994)"},{"issue":"2","key":"26_CR5","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1137\/0213018","volume":"13","author":"J.M. Robson","year":"1984","unstructured":"Robson, J.M.: N by n checkers is exptime complete. SIAM J. Comput.\u00a013(2), 252\u2013267 (1984)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Fun with Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30347-0_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:37:15Z","timestamp":1620113835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30347-0_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642303463","9783642303470"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30347-0_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}