Pages that link to "Item:Q1090274"

The following pages link to PSPACE-Hardness of some combinatorial games (Q1090274):

Displaying 24 items.

• Phutball is PSPACE-hard (Q410721) (← links)
• The set coincidence game: Complexity, attainability, and symmetric strategies (Q582100) (← links)
• The complexity of node blocking for dags (Q616455) (← links)
• The complexity of pursuit on a graph (Q673639) (← links)
• On the shortest path game (Q729795) (← links)
• The complexity of coloring games on perfect graphs (Q1202928) (← links)
• Undirected edge geography (Q1210301) (← links)
• Complexity of path-forming games (Q1210546) (← links)
• The Othello game on an \(n\times n\) board is PSPACE-complete (Q1314386) (← links)
• Recent results and questions in combinatorial game complexities (Q1583532) (← 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)
• \textsf{PSPACE}-complete two-color planar placement games (Q2002060) (← links)
• \textsf{PSPACE}-hardness of variants of the graph coloring game (Q2078618) (← links)
• PSPACE-hardness of two graph coloring games (Q2132363) (← links)
• \(2^{3}\) quantified Boolean formula games and their complexities (Q2829173) (← links)
• On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games (Q3305726) (← links)
• Computational complexity of generalized Push Fight (Q3305729) (← links)
• (Q5090999) (← links)
• Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete (Q5326586) (← links)
• On the complexity and topology of scoring games: of pirates and treasure (Q5384136) (← links)
• Mathematical Foundations of Computer Science 2003 (Q5431341) (← links)
• Chess is hard even for a single player (Q6614005) (← links)