{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T15:27:31Z","timestamp":1762270051949},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7137,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1994,1]]},"DOI":"10.1016\/0304-3975(94)90131-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"329-340","source":"Crossref","is-referenced-by-count":33,"title":["The Othello game on an n \u00d7 n board is PSPACE-complete"],"prefix":"10.1016","volume":"123","author":[{"given":"Shigeki","family":"Iwata","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takumi","family":"Kasai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90131-7_BIB1","first-page":"1843","article-title":"Shogi n \u00d7 n board is complete in exponential time","volume":"J70-D","author":"Adachi","year":"1987","journal-title":"Trans. IEICE"},{"key":"10.1016\/0304-3975(94)90131-7_BIB2","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","article-title":"Alternation","volume":"28","author":"Chandra","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)90131-7_BIB3","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1145\/321978.321989","article-title":"A combinatorial problem which is complete in polynomial space","volume":"23","author":"Even","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)90131-7_BIB4","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0097-3165(81)90016-9","article-title":"Computing a perfect strategy for n \u00d7 n chess requires time exponential in n","volume":"31","author":"Fraenkel","year":"1981","journal-title":"J. Combin. Theory Ser. A."},{"key":"10.1016\/0304-3975(94)90131-7_BIB5","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1137\/0211025","article-title":"Planar formulae and their uses","volume":"11","author":"Lichtenstein","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)90131-7_BIB6","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1145\/322186.322201","article-title":"GO is polynomial-space hard","volume":"27","author":"Lichtenstein","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)90131-7_BIB7","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF00288536","article-title":"Gobang ist PSPACE-vollst\u00e4ndig","volume":"13","author":"Reisch","year":"1980","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(94)90131-7_BIB8","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BF00288964","article-title":"Hex ist PSPACE-vollst\u00e4ndig","volume":"15","author":"Reisch","year":"1981","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(94)90131-7_BIB9","first-page":"413","article-title":"The complexity of GO","author":"Robson","year":"1983","journal-title":"Proc. IFIP 1983"},{"key":"10.1016\/0304-3975(94)90131-7_BIB10","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1137\/0213018","article-title":"N by N checkers is EXPTIME complete","volume":"13","author":"Robson","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)90131-7_BIB11","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0022-0000(78)90045-4","article-title":"On the complexity of some two-person perfect-information games","volume":"16","author":"Schaefer","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(94)90131-7_BIB12","first-page":"270","article-title":"Generalized Hi-Q is NP-complete","volume":"E73","author":"Uehara","year":"1990","journal-title":"Trans. IEICE"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594901317?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594901317?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:26:02Z","timestamp":1555129562000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594901317"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["0304397594901317"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90131-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,1]]}}}