{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T17:39:21Z","timestamp":1784914761751,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540406716","type":"print"},{"value":"9783540451389","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45138-9_47","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T18:41:48Z","timestamp":1277232108000},"page":"531-540","source":"Crossref","is-referenced-by-count":30,"title":["Solving the Sabotage Game Is PSPACE-Hard"],"prefix":"10.1007","author":[{"given":"Christof","family":"L\u00f6ding","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Philipp","family":"Rohde","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"47_CR1","series-title":"LNAI","volume-title":"Festschrift in Honour of Prof. J\u00f6rg Siekmann","author":"J. Benthem van","year":"2002","unstructured":"van Benthem, J.: An essay on sabotage and obstruction. In: Hutter, D., Werner, S. (eds.) Festschrift in Honour of Prof. J\u00f6rg Siekmann. LNCS (LNAI), Springer, Heidelberg (2002)"},{"key":"47_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/3-540-44683-4_3","volume-title":"Mathematical Foundations of Computer Science 2001","author":"E.D. Demaine","year":"2001","unstructured":"Demaine, E.D.: Playing games with algorithms: Algorithmic combinatorial game theory. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol.\u00a02136, pp. 18\u201332. Springer, Heidelberg (2001)"},{"key":"47_CR3","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison\u2013Wesley, London (1994)"},{"key":"47_CR4","doi-asserted-by":"crossref","unstructured":"L\u00f6ding, C., Rohde, P.: Solving the sabotage game is PSPACE-hard. Technical Report AIB-05-2003, RWTH Aachen (2003)","DOI":"10.1007\/978-3-540-45138-9_47"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45138-9_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T05:54:18Z","timestamp":1559195658000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45138-9_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540406716","9783540451389"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45138-9_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}