{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T12:51:17Z","timestamp":1761742277948},"reference-count":10,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1983,8,1]],"date-time":"1983-08-01T00:00:00Z","timestamp":428544000000},"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":10943,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1983,8]]},"DOI":"10.1016\/0022-0000(83)90030-2","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"77-100","source":"Crossref","is-referenced-by-count":10,"title":["On the complexity of chess"],"prefix":"10.1016","volume":"27","author":[{"given":"James A.","family":"Storer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(83)90030-2_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0022-0000(83)90030-2_BIB2","series-title":"Proceedings, 17 Annual IEEE Symposium on Foundations of Computer Science","first-page":"98","article-title":"Alternation","author":"Chandra","year":"1976"},{"key":"10.1016\/0022-0000(83)90030-2_BIB3","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1145\/321978.321989","article-title":"A combinatorial game which is complete in polynomial space","volume":"23","author":"Even","year":"1976","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(83)90030-2_BIB4","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0097-3165(81)90016-9","article-title":"Computing a perfect strategy for NxN chess requires time exponential in N","volume":"31","author":"Fraenkel","year":"1981","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0022-0000(83)90030-2_BIB5","series-title":"Proceedings, 19 Annual IEEE Symposium on Foundations of Computer Science, Ann Arbor","first-page":"55","article-title":"The complexity of checkers on an NxN Board\u2014Preliminary Report","author":"Fraenkel","year":"1978"},{"key":"10.1016\/0022-0000(83)90030-2_BIB6","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0022-0000(83)90030-2_BIB7","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","article-title":"Efficient planarity testing","volume":"21","author":"Hopcroft","year":"1974","journal-title":"J. Assoc. Comp. Mach."},{"key":"10.1016\/0022-0000(83)90030-2_BIB8","series-title":"Proceedings, 19 Annual IEE Symposium on Foundations of Computer Science","first-page":"48","article-title":"GO is PSPACE-Hard","author":"Lichtenstein","year":"1978"},{"key":"10.1016\/0022-0000(83)90030-2_BIB9","series-title":"Proceedings, Fifth Annual ACM Symposium on Theory of Computing","first-page":"1","article-title":"Word problems requiring exponential time","author":"Meyer","year":"1973"},{"key":"10.1016\/0022-0000(83)90030-2_BIB10","series-title":"Proceedings, Eighth Annual ACM Symposium on Theory of Computing","first-page":"41","article-title":"Complexity of decision problems based on finite two-person perfect-information games","author":"Schaefer","year":"1976"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000083900302?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000083900302?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:51:00Z","timestamp":1550307060000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000083900302"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,8]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,8]]}},"alternative-id":["0022000083900302"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(83)90030-2","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1983,8]]}}}