Pages that link to "Item:Q1248466"

The following pages link to On the complexity of some two-person perfect-information games (Q1248466):

Displaying 50 items.

• On the complexity of connection games (Q307770) (← links)
• Complexity of the game domination problem (Q313955) (← links)
• Problems on cycles and colorings (Q383772) (← links)
• Impartial coloring games (Q388789) (← links)
• UNO is hard, even for a single player (Q389942) (← links)
• Deciding the winner in \(k\) rounds for DISJOINT ARROWS, a new combinatorial partizan game (Q391980) (← links)
• Phutball is PSPACE-hard (Q410721) (← links)
• Exact algorithms for Kayles (Q476858) (← links)
• On the complexity of computing winning strategies for finite poset games (Q537910) (← links)
• The set coincidence game: Complexity, attainability, and symmetric strategies (Q582100) (← links)
• The complexity of node blocking for dags (Q616455) (← links)
• Invariant and dual subtraction games resolving the Duchêne-Rigo conjecture (Q627170) (← links)
• Modular Nim (Q673073) (← links)
• On the shortest path game (Q729795) (← links)
• Maker-Breaker domination game (Q776271) (← links)
• Prohibiting repetitions makes playing games substantially harder (Q794942) (← links)
• The complexity of two-player games of incomplete information (Q800838) (← links)
• The complexity of constraint satisfaction games and QCSP (Q840700) (← links)
• Update games and update networks (Q876693) (← links)
• Games on interval and permutation graph representations (Q897865) (← links)
• Compound Node-Kayles on paths (Q1019180) (← links)
• On chooser-picker positional games (Q1044991) (← links)
• Is distributed locking harder? (Q1061510) (← links)
• Games against nature (Q1069296) (← links)
• PSPACE-Hardness of some combinatorial games (Q1090274) (← links)
• Single-suit two-person card play (Q1093570) (← links)
• Hex ist Pspace-vollständig. (Hex is Pspace-complete) (Q1138494) (← links)
• The complexity of problems in systems of communicating sequential processes (Q1146980) (← links)
• Theory of annihilation games. I (Q1168901) (← links)
• The complexity of short two-person games (Q1173637) (← links)
• Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families (Q1186787) (← links)
• Generalizations of Opt P to the polynomial hierarchy (Q1193867) (← links)
• The complexity of coloring games on perfect graphs (Q1202928) (← links)
• Undirected edge geography (Q1210301) (← links)
• Geography (Q1210545) (← links)
• Complexity of path-forming games (Q1210546) (← links)
• Gobang is PSPACE-complete (Q1255445) (← links)
• Heap games, numeration systems and sequences (Q1293425) (← links)
• The Othello game on an \(n\times n\) board is PSPACE-complete (Q1314386) (← links)
• A short certificate of the number of universal optimal strategies for stopping simple stochastic games (Q1350746) (← links)
• A note on first-order projections and games. (Q1401218) (← links)
• Complexity of path discovery game problems (Q1566737) (← links)
• Recent results and questions in combinatorial game complexities (Q1583532) (← links)
• Decision algorithms for multiplayer noncooperative games of incomplete information (Q1609052) (← links)
• On variants of vertex geography on undirected graphs (Q1627869) (← links)
• Octal games on graphs: the game 0.33 on subdivided stars and bistars (Q1784739) (← links)
• Impartial poker nim (Q1791298) (← links)
• Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete. (Q1853560) (← links)
• Traveling salesmen in the presence of competition (Q1884998) (← links)
• Complexity, appeal and challenges of combinatorial games (Q1884999) (← links)