{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:50:32Z","timestamp":1759063832318},"reference-count":9,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1993,2,1]],"date-time":"1993-02-01T00:00:00Z","timestamp":728524800000},"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":7471,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1993,2]]},"DOI":"10.1016\/0012-365x(93)90185-v","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:34Z","timestamp":1027655014000},"page":"481-483","source":"Crossref","is-referenced-by-count":2,"title":["Shannon-like games are difficult"],"prefix":"10.1016","volume":"111","author":[{"given":"Y\u014dhei","family":"Yamasaki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(93)90185-V_BIB1","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0012-365X(93)90185-V_BIB2","series-title":"Winning ways","author":"Berlekamph","year":"1982"},{"key":"10.1016\/0012-365X(93)90185-V_BIB3","article-title":"A combinatorial problem which is complete in polynomial space","author":"Even","year":"1975","journal-title":"Proc. 7th ACM Symp. on the Theory of Computing"},{"key":"10.1016\/0012-365X(93)90185-V_BIB4","doi-asserted-by":"crossref","DOI":"10.1007\/BF00288964","article-title":"Hex ist PSPACE-vollst\u00e4ndig","volume":"15","author":"Reisch","year":"1981","journal-title":"Acta Inform."},{"key":"10.1016\/0012-365X(93)90185-V_BIB5","doi-asserted-by":"crossref","first-page":"337","DOI":"10.2977\/prims\/1195189068","article-title":"Theory of division games","volume":"17","author":"Yamasaki","year":"1978","journal-title":"Publ. Res. Inst. Math. Sci."},{"key":"10.1016\/0012-365X(93)90185-V_BIB6","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/BF01788679","article-title":"Shannon switching games without terminals II","volume":"5","author":"Yamasaki","year":"1989","journal-title":"Graphs and Combin."},{"key":"10.1016\/0012-365X(93)90185-V_BIB7","series-title":"Combinatorial Games: Back and Front","author":"Yamasaki","year":"1989"},{"key":"10.1016\/0012-365X(93)90185-V_BIB8","unstructured":"Y. Yamasaki, Shannon switching games without terminals III, submitted."},{"key":"10.1016\/0012-365X(93)90185-V_BIB9","doi-asserted-by":"crossref","unstructured":"Y. Yamasaki, A difficulty in particular Shannon-like games, Discrete Appl. Math., to appear.","DOI":"10.1016\/0166-218X(91)90017-Q"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9390185V?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9390185V?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:51:37Z","timestamp":1555134697000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9390185V"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,2]]},"references-count":9,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1993,2]]}},"alternative-id":["0012365X9390185V"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(93)90185-v","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,2]]}}}