{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T14:14:42Z","timestamp":1775657682123,"version":"3.50.1"},"reference-count":18,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1984,10,1]],"date-time":"1984-10-01T00:00:00Z","timestamp":465436800000},"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":10516,"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":[[1984,10]]},"DOI":"10.1016\/0022-0000(84)90034-5","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"274-301","source":"Crossref","is-referenced-by-count":157,"title":["The complexity of two-player games of incomplete information"],"prefix":"10.1016","volume":"29","author":[{"given":"John H.","family":"Reif","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(84)90034-5_BIB1","article-title":"Alternation","author":"Chandra","year":"1978"},{"key":"10.1016\/0022-0000(84)90034-5_BIB2","series-title":"Proceedings, 7th Annual ACM Sympos. on Theory of Computing","first-page":"41","article-title":"A combinatorial problem which is complete in polynomial space","author":"Even","year":"1976"},{"key":"10.1016\/0022-0000(84)90034-5_BIB3","series-title":"Proceedings, 19th IEEE Sympos. on Foundations of Computer Science","first-page":"55","article-title":"The complexity of checkers on an N \u00d7 N board\u2014Preliminary report","author":"Fraenkel","year":"1978"},{"key":"10.1016\/0022-0000(84)90034-5_BIB4","series-title":"Proceedings, 8th Internat. Colloq. Automata. Lang. & Programming","first-page":"278","article-title":"Computing a perfect strategy for n \u00d7 n chess requires time exponential in N","author":"Fraenkel","year":"1981"},{"key":"10.1016\/0022-0000(84)90034-5_BIB5","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1090\/S0002-9947-1965-0170805-7","article-title":"On the computational complexity of algorithms","volume":"117","author":"Hartmanis","year":"1965","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0022-0000(84)90034-5_BIB6","first-page":"4","article-title":"Blindfold games are harder than games with perfect information","volume":"6","author":"Jones","year":"1978","journal-title":"Bull. European Assoc. for Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(84)90034-5_BIB7","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":"1975","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(84)90034-5_BIB8","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1145\/322186.322201","article-title":"Go is Pspace hard","volume":"27","author":"Lichtenstein","year":"1980","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(84)90034-5_BIB9","series-title":"Proceedings, 20th IEEE Sympos. on Foundations of Computer Science","article-title":"Multiple person alternation","author":"Peterson","year":"1979"},{"key":"10.1016\/0022-0000(84)90034-5_BIB10","series-title":"Proceedings, 21st IEEE Sympos. on Foundations of Computer Science","first-page":"86","article-title":"Succinct representation of random strings, and complexity classes","author":"Peterson","year":"1980"},{"key":"10.1016\/0022-0000(84)90034-5_BIB11","series-title":"Proceedings, 11th Annual ACM Sympos. for Theory of Computing","article-title":"Universal two person games of incomplete information","author":"Reif","year":"1979"},{"key":"10.1016\/0022-0000(84)90034-5_BIB12","series-title":"Proceedings, 7th Annual ACM Symposium on Principles of Programming-Languages","first-page":"193","article-title":"A dynamic logic of multiprocessing with incomplete information","author":"Reif","year":"1980"},{"key":"10.1016\/0022-0000(84)90034-5_BIB13","article-title":"Decision Algorithms for Multiplayer Games of Incomplete Information","author":"Reif","year":"1981"},{"key":"10.1016\/0022-0000(84)90034-5_BIB14","first-page":"177","article-title":"Relationships between nondeterministic and deterministic tape complexities","volume":"4","author":"Savitch","year":"1970","journal-title":"J. Comput. Sci."},{"issue":"No. 2","key":"10.1016\/0022-0000(84)90034-5_BIB15","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/0022-0000(78)90045-4","article-title":"Complexity of some two person perfect-information games","volume":"16","author":"Schaefer","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(84)90034-5_BIB16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","article-title":"The polynomial-time hierarchy","volume":"3","author":"Stockmeyer","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(84)90034-5_BIB17","series-title":"Proceedings 5th ACM Sympos. on Theory of Computing","first-page":"1","article-title":"Word problems requiring exponential time: Preliminary report","author":"Stockmeyer","year":"1973"},{"issue":"No. 2","key":"10.1016\/0022-0000(84)90034-5_BIB18","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":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000084900345?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000084900345?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:51:42Z","timestamp":1550325102000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000084900345"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,10]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1984,10]]}},"alternative-id":["0022000084900345"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(84)90034-5","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1984,10]]}}}