{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T21:21:21Z","timestamp":1649020881949},"reference-count":9,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,4,1]],"date-time":"2000-04-01T00:00:00Z","timestamp":954547200000},"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":4855,"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":[[2000,4]]},"DOI":"10.1016\/s0304-3975(99)00331-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:30:39Z","timestamp":1027650639000},"page":"381-406","source":"Crossref","is-referenced-by-count":1,"title":["Complexity of path discovery game problems"],"prefix":"10.1016","volume":"237","author":[{"given":"Hiroaki","family":"Tohyama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akeo","family":"Adachi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00331-X_BIB1","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. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(99)00331-X_BIB2","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0097-3165(81)90016-9","article-title":"Computing a perfect strategy for n by n chess requires time exponential in n","volume":"31","author":"Fraenkel","year":"1981","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0304-3975(99)00331-X_BIB3","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/S0022-0000(75)80050-X","article-title":"Space-bounded reducibility among combinatorial problems","volume":"11","author":"Jones","year":"1972","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/S0304-3975(99)00331-X_BIB4","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1137\/0208046","article-title":"Classes of pebble games and complete problems","volume":"8","author":"Kasai","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(99)00331-X_BIB5","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0304-3975(82)90058-5","article-title":"Symmetric space-bounded computation","volume":"19","author":"Lewis","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00331-X_BIB6","unstructured":"J.M. Robson, The Complexity of Go, IFIP World Computer Congress, 1983, pp. 413\u2013417."},{"key":"10.1016\/S0304-3975(99)00331-X_BIB7","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\/S0304-3975(99)00331-X_BIB8","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\/S0304-3975(99)00331-X_BIB9","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1137\/0208013","article-title":"Provably difficult combinatorial games","volume":"8","author":"Stockmeyer","year":"1979","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759900331X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759900331X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T14:56:04Z","timestamp":1555253764000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439759900331X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,4]]},"references-count":9,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,4]]}},"alternative-id":["S030439759900331X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00331-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,4]]}}}