{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T21:29:04Z","timestamp":1648848544708},"reference-count":9,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"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":8233,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1991,1]]},"DOI":"10.1016\/0166-218x(91)90017-q","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:46:59Z","timestamp":1027640819000},"page":"87-90","source":"Crossref","is-referenced-by-count":2,"title":["A difficulty in particular Shannon-like games"],"prefix":"10.1016","volume":"30","author":[{"given":"Y\u014dhei","family":"Yamasaki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(91)90017-Q_BIB1","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0166-218X(91)90017-Q_BIB2","series-title":"Winning Ways","author":"Berlekamp","year":"1982"},{"key":"10.1016\/0166-218X(91)90017-Q_BIB3","first-page":"1","article-title":"Networks and the Shannon switching game","volume":"4","author":"Brualdi","year":"1974","journal-title":"Delta"},{"key":"10.1016\/0166-218X(91)90017-Q_BIB4","article-title":"A combinatorial problem which is complete in polynomial space","author":"Even","year":"1975","journal-title":"Proceedings 7th ACM Symposium on the Theory of Computing"},{"key":"10.1016\/0166-218X(91)90017-Q_BIB5","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\/0166-218X(91)90017-Q_BIB6","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\/0166-218X(91)90017-Q_BIB7","series-title":"Combinatorial Games: Back and Front","author":"Yamasaki","year":"1989"},{"key":"10.1016\/0166-218X(91)90017-Q_BIB8","doi-asserted-by":"crossref","unstructured":"Y. Yamasaki, Shannon switching games without terminals II, Graphs Combin., to appear.","DOI":"10.1007\/BF01788679"},{"key":"10.1016\/0166-218X(91)90017-Q_BIB9","unstructured":"Y. Yamasaki, Shannon switching games without terminals III, submitted."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9190017Q?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9190017Q?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:50:50Z","timestamp":1555116650000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9190017Q"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,1]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,1]]}},"alternative-id":["0166218X9190017Q"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(91)90017-q","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1991,1]]}}}