On the public citation graph

Playing disjunctive sums is polynomial space complete

https://doi.org/10.1007/bf01755964
0 signed · 22 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1145/321978.321989openalex-snapshot
A Combinatorial Problem Which Is Complete in Polynomial Space
inferredcites →https://doi.org/10.1145/322186.322201openalex-snapshot
GO Is Polynomial-Space Hard
inferredcites →https://doi.org/10.1145/800125.804029openalex-snapshot
Word problems requiring exponential time(Preliminary Report)
inferredcites →https://doi.org/10.1201/9781439864159openalex-snapshot
On Numbers and Games

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-48957-6_15openalex-snapshot
On the Complexity of Tsume-Go
inferred← citeshttps://doi.org/10.1007/bf01756027openalex-snapshot
Single-suit two-person card play
inferred← citeshttps://doi.org/10.1007/bf01769863openalex-snapshot
Prohibiting repetitions makes playing games substantially harder
inferred← citeshttps://doi.org/10.1016/0012-365x(83)90202-9openalex-snapshot
Problem 38
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90356-xopenalex-snapshot
Geography
inferred← citeshttps://doi.org/10.1016/b978-0-444-53766-9.00015-xopenalex-snapshot
Theory of Combinatorial Games
inferred← citeshttps://doi.org/10.1016/j.tcs.2002.11.001openalex-snapshot
Complexity, appeal and challenges of combinatorial games
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115656openalex-snapshot
A tractability gap beyond nim-sums: It’s hard to tell whether a bunch of superstars are losers
inferred← citeshttps://doi.org/10.1016/s0004-3702(01)00121-7openalex-snapshot
Computer Go
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00062-1openalex-snapshot
Recent results and questions in combinatorial game complexities
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00179-7openalex-snapshot
Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete
inferred← citeshttps://doi.org/10.1017/9781009701839.004openalex-snapshot
Scenic Trails Ascending from Sea-Level Nim to Alpine Chess
inferred← citeshttps://doi.org/10.1017/9781316135167.011openalex-snapshot
Go Endgames Are PSPACE-Hard
inferred← citeshttps://doi.org/10.1017/9781316135167.021openalex-snapshot
Who Wins Domineering on Rectangular Boards?
inferred← citeshttps://doi.org/10.1017/9781316135167.033openalex-snapshot
Combinatorial Games: Selected Bibliography With A Succinct Gourmet Introduction
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00119openalex-snapshot
Winning the War by (Strategically) Losing Battles: Settling the Complexity of Grundy-Values in Undirected Geography
inferred← citeshttps://doi.org/10.48550/arxiv.math/0006066openalex-snapshot
Who Wins Domineering on Rectangular Boards?
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.