On the public citation graph

Single-suit two-person card play

https://doi.org/10.1007/bf01756027
0 signed · 21 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/bf00143897openalex-snapshot
Single-suit two-person card play II. Dominance
inferredcites →https://doi.org/10.1007/bf00288536openalex-snapshot
Gobang ist PSPACE-vollst�ndig
inferredcites →https://doi.org/10.1007/bf00288964openalex-snapshot
Hex ist PSPACE-vollst�ndig
inferredcites →https://doi.org/10.1007/bf01755964openalex-snapshot
Playing disjunctive sums is polynomial space complete
inferredcites →https://doi.org/10.1016/0022-0000(78)90045-4openalex-snapshot
On the complexity of some two-person perfect-information games
inferredcites →https://doi.org/10.1016/0097-3165(81)90016-9openalex-snapshot
Computing a perfect strategy for n × n chess requires time exponential in n
inferredcites →https://doi.org/10.1137/0208013openalex-snapshot
Provably Difficult Combinatorial Games
inferredcites →https://doi.org/10.1137/0209038openalex-snapshot
The Pebbling Problem 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/800076.802476openalex-snapshot
Low level complexity for combinatorial 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/978-3-642-04428-1_7openalex-snapshot
Subset Weight Maximization with Two Competing Agents
inferred← citeshttps://doi.org/10.1007/bf00143897openalex-snapshot
Single-suit two-person card play II. Dominance
inferred← citeshttps://doi.org/10.1007/bfb0004259openalex-snapshot
On Lasker's card game
inferred← citeshttps://doi.org/10.1007/s10479-011-1057-2openalex-snapshot
Strategies in competing subset selection
inferred← citeshttps://doi.org/10.1016/j.dam.2010.11.011openalex-snapshot
Competitive subset selection with two agents
inferred← citeshttps://doi.org/10.1016/j.disc.2014.04.005openalex-snapshot
Combinatorial games modeling seki in GO
inferred← citeshttps://doi.org/10.1017/9781316135167.033openalex-snapshot
Combinatorial Games: Selected Bibliography With A Succinct Gourmet Introduction
inferred← citeshttps://doi.org/10.1137/0402029openalex-snapshot
Single-Suit Two-Person Card Play III. The Misère Game
inferred← citeshttps://doi.org/10.3390/designs7010004openalex-snapshot
Whist Game Cards Calibration Strategies-Based Technique for Conceptual Design Morphological Chart Refinement
inferred← citeshttps://doi.org/10.37236/1940openalex-snapshot
A Solution of Two-Person Single-Suit Whist
inferred← citeshttps://doi.org/10.37236/1941openalex-snapshot
Two-Person Symmetric Whist
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.