{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:15:00Z","timestamp":1725495300970},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540430803"},{"type":"electronic","value":"9783540455790"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45579-5_16","type":"book-chapter","created":{"date-parts":[[2007,11,16]],"date-time":"2007-11-16T12:52:18Z","timestamp":1195217538000},"page":"241-249","source":"Crossref","is-referenced-by-count":26,"title":["Ladders Are PSPACE-Complete"],"prefix":"10.1007","author":[{"given":"Marcel","family":"Cr\u00e2\u015fmaru","sequence":"first","affiliation":[]},{"given":"John","family":"Tromp","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,12,20]]},"reference":[{"key":"16_CR1","unstructured":"Garey, M., R., Johnson, D., S., Computers and Intractability, Bell Telephone Laboratories, (1979)"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1145\/322186.322201","volume":"27","author":"D. Lichtenstein","year":"1980","unstructured":"Lichtenstein, D. and Sipser, M., GO is Polynomial-Space Hard, Journal of the ACM, Vol. 27, No. 2, (April 1980) 393\u2013401.","journal-title":"Journal of the ACM"},{"key":"16_CR3","unstructured":"Robson, J., The Complexity of Go, Proc. IFIP (International Federation of Information Processing), (1983) 413\u2013417."},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Robson, J., Combinatorial games with exponential space complete decision problems, Proc. 11th Symposium on Mathematical Foundations of Computer Science, (1984) 498\u2013506.","DOI":"10.1007\/BFb0030333"},{"key":"16_CR5","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80023-1","volume":"67","author":"J. Robson","year":"1985","unstructured":"Robson, J., Alternation with Restrictions on Looping, Information and Control, Vol. 67, 2\u201311 (1985).","journal-title":"Alternation with Restrictions on Looping, Information and Control"},{"key":"16_CR6","unstructured":"Papadimitriou, H., Computational complexity, Addison-Wesley, (1994)"}],"container-title":["Lecture Notes in Computer Science","Computers and Games"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45579-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T12:17:47Z","timestamp":1551097067000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45579-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540430803","9783540455790"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-45579-5_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}