{"@context":{"@vocab":"https://cir.nii.ac.jp/schema/1.0/","rdfs":"http://www.w3.org/2000/01/rdf-schema#","dc":"http://purl.org/dc/elements/1.1/","dcterms":"http://purl.org/dc/terms/","foaf":"http://xmlns.com/foaf/0.1/","prism":"http://prismstandard.org/namespaces/basic/2.0/","cinii":"http://ci.nii.ac.jp/ns/1.0/","datacite":"https://schema.datacite.org/meta/kernel-4/","ndl":"http://ndl.go.jp/dcndl/terms/","jpcoar":"https://github.com/JPCOAR/schema/blob/master/2.0/"},"@id":"https://cir.nii.ac.jp/crid/1360011144446830592.json","@type":"Article","productIdentifier":[{"identifier":{"@type":"DOI","@value":"10.1016/0304-3975(94)90131-7"}},{"identifier":{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:0304397594901317?httpAccept=text/xml"}},{"identifier":{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:0304397594901317?httpAccept=text/plain"}}],"dc:title":[{"@value":"The Othello game on an n × n board is PSPACE-complete"}],"description":[{"notation":[{"@value":"AbstractGiven an arbitrary position of the Othello game played on an n × n board, the problem of determining the winner is shown to be PSPACE-complete. It can be reduced from generalized geography played on bipartite graphs with maximum degree 3."}]}],"creator":[{"@id":"https://cir.nii.ac.jp/crid/1380011144446830593","@type":"Researcher","foaf:name":[{"@value":"Shigeki Iwata"}]},{"@id":"https://cir.nii.ac.jp/crid/1030003658312586240","@type":"Researcher","personIdentifier":[{"@type":"KAKEN_RESEARCHERS","@value":"70027382"},{"@type":"NRID","@value":"1000070027382"},{"@type":"NRID","@value":"9000004342438"},{"@type":"NRID","@value":"9000021565010"},{"@type":"NRID","@value":"9000007972397"},{"@type":"NRID","@value":"9000018351669"},{"@type":"NRID","@value":"9000006121456"},{"@type":"NRID","@value":"9000004373083"},{"@type":"NRID","@value":"9000004836706"},{"@type":"NRID","@value":"9000004892737"},{"@type":"NRID","@value":"9000253245720"},{"@type":"NRID","@value":"9000008212411"},{"@type":"RESEARCHMAP","@value":"https://researchmap.jp/read0087283"}],"foaf:name":[{"@value":"Takumi Kasai"}]}],"publication":{"publicationIdentifier":[{"@type":"PISSN","@value":"03043975"}],"prism:publicationName":[{"@value":"Theoretical Computer Science"}],"dc:publisher":[{"@value":"Elsevier BV"}],"prism:publicationDate":"1994-01","prism:volume":"123","prism:number":"2","prism:startingPage":"329","prism:endingPage":"340"},"reviewed":"false","dcterms:accessRights":"http://purl.org/coar/access_right/c_abf2","dc:rights":["https://www.elsevier.com/tdm/userlicense/1.0/","https://www.elsevier.com/open-access/userlicense/1.0/"],"url":[{"@id":"https://api.elsevier.com/content/article/PII:0304397594901317?httpAccept=text/xml"},{"@id":"https://api.elsevier.com/content/article/PII:0304397594901317?httpAccept=text/plain"}],"createdAt":"2002-07-26","modifiedAt":"2019-04-13","foaf:topic":[{"@id":"https://cir.nii.ac.jp/all?q=Theoretical%20Computer%20Science","dc:title":"Theoretical Computer Science"},{"@id":"https://cir.nii.ac.jp/all?q=Computer%20Science(all)","dc:title":"Computer Science(all)"}],"relatedProduct":[{"@id":"https://cir.nii.ac.jp/crid/1360848664401446016","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"A Polynomial-Time Reduction from the 3SAT Problem to the Generalized String Puzzle Problem"}]},{"@id":"https://cir.nii.ac.jp/crid/1390001204379343104","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"NP-Hard and k-EXPSPACE-Hard Cast Puzzles"}]},{"@id":"https://cir.nii.ac.jp/crid/1390001205295211776","@type":"Article","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Scrabble is PSPACE-Complete"}]},{"@id":"https://cir.nii.ac.jp/crid/1390282679356373120","@type":"Article","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Generalized Chat Noir is PSPACE-Complete"}]},{"@id":"https://cir.nii.ac.jp/crid/1390296808234333312","@type":"Article","resourceType":"紀要論文(departmental bulletin paper)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Computational Complexity of Puzzles and Related Topics"}]}],"dataSourceIdentifier":[{"@type":"CROSSREF","@value":"10.1016/0304-3975(94)90131-7"},{"@type":"OPENAIRE","@value":"doi_dedup___::2596d38a44612bc67fb6c7d448851240"},{"@type":"CROSSREF","@value":"10.1587/transinf.e93.d.2995_references_DOI_GKuGLB5QN8ANv6VxiPas69HQltu"},{"@type":"CROSSREF","@value":"10.4036/iis.2022.r.06_references_DOI_GKuGLB5QN8ANv6VxiPas69HQltu"},{"@type":"CROSSREF","@value":"10.3390/a5020261_references_DOI_GKuGLB5QN8ANv6VxiPas69HQltu"},{"@type":"CROSSREF","@value":"10.2197/ipsjjip.23.284_references_DOI_GKuGLB5QN8ANv6VxiPas69HQltu"},{"@type":"CROSSREF","@value":"10.1587/transinf.e96.d.502_references_DOI_GKuGLB5QN8ANv6VxiPas69HQltu"}]}