Pages that link to "Item:Q4127387"

The following pages link to A Combinatorial Problem Which Is Complete in Polynomial Space (Q4127387):

Displaying 41 items.

• On the complexity of connection games (Q307770) (← links)
• UNO is hard, even for a single player (Q389942) (← links)
• Phutball is PSPACE-hard (Q410721) (← links)
• Hanabi is NP-hard, even for cheaters who look at their cards (Q528493) (← links)
• The set coincidence game: Complexity, attainability, and symmetric strategies (Q582100) (← links)
• The complexity of two-player games of incomplete information (Q800838) (← links)
• On Ringeisen's isolation game. II (Q804481) (← links)
• On the complexity of chess (Q1054641) (← links)
• PSPACE-Hardness of some combinatorial games (Q1090274) (← links)
• The complexity of problems in systems of communicating sequential processes (Q1146980) (← links)
• Playing disjunctive sums is polynomial space complete (Q1159098) (← links)
• Theory of annihilation games. I (Q1168901) (← links)
• A difficulty in particular Shannon-like games (Q1173983) (← links)
• Complexity of path-forming games (Q1210546) (← links)
• On the complexity of some two-person perfect-information games (Q1248466) (← links)
• Theory of division games (Q1252163) (← 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)
• Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete. (Q1853560) (← links)
• Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues (Q1892937) (← links)
• Game edge-connectivity of graphs (Q2028096) (← links)
• Colored cut games (Q2087453) (← links)
• Twenty years of progress of \(\mathrm{JCDCG}^3\) (Q2308489) (← links)
• Complexity of question/answer games (Q2378516) (← links)
• Topological games at Princeton, a mathematical memoir (Q2389292) (← links)
• Hex and combinatorics (Q2433713) (← links)
• Havannah and TwixT are PSPACE-complete (Q2947922) (← links)
• (Q3390714) (← links)
• Some Completeness Results on Decision Trees and Group Testing (Q3801062) (← links)
• The complexity of recursion theoretic games (Q5694972) (← links)
• The largest connected subgraph game (Q5918781) (← links)
• The largest connected subgraph game (Q5925553) (← links)
• Lower bounds for multiplayer noncooperative games of incomplete information (Q5948765) (← links)
• A hierarchical approach to computer Hex (Q5958203) (← links)
• Games solved: Now and in the future (Q5958209) (← links)
• Nimber-preserving reduction: game secrets and homomorphic Sprague-Grundy theorem (Q6562875) (← links)
• Complexity of maker-breaker games on edge sets of graphs (Q6657252) (← links)