Pages that link to "Item:Q2127615"
From MaRDI portal
The following pages link to On the computational complexities of various geography variants (Q2127615):
Displaying 12 items.
- Deciding the winner in \(k\) rounds for DISJOINT ARROWS, a new combinatorial partizan game (Q391980) (← links)
- The computation of megamaps (Q890988) (← links)
- PSPACE-Hardness of some combinatorial games (Q1090274) (← links)
- Undirected edge geography (Q1210301) (← links)
- Geography (Q1210545) (← links)
- Complexity of path-forming games (Q1210546) (← links)
- Complexities of winning strategies in diophantine games (Q1908042) (← links)
- On the complexity of the misère version of three games played on graphs (Q2354773) (← links)
- Computational complexity of generalized Push Fight (Q3305729) (← links)
- On the complexity and topology of scoring games: of pirates and treasure (Q5384136) (← links)
- The computational complexity of Evil Hangman (Q6487596) (← links)
- Geography, Kotzig's Nim, and variants (Q6652444) (← links)