Pages that link to "Item:Q1139510"
From MaRDI portal
The following pages link to A complete analysis of von Neumann's Hackendot (Q1139510):
Displaying 11 items.
- On the complexity of computing winning strategies for finite poset games (Q537910) (← links)
- A deletion game on hypergraphs (Q805510) (← links)
- PSPACE-Hardness of some combinatorial games (Q1090274) (← links)
- Geodetic contraction games on graphs (Q1124532) (← links)
- A complete analysis of black-white Hackendot (Q1161458) (← links)
- Recent results and questions in combinatorial game complexities (Q1583532) (← links)
- Complexity, appeal and challenges of combinatorial games (Q1884999) (← links)
- Winning ways of weighted poset games (Q2373442) (← links)
- Geodetic Contraction Games on Trees (Q4632218) (← links)
- The Complexity of Poset Games (Q5084701) (← links)
- (Q5384203) (← links)