Pages that link to "Item:Q3316590"
From MaRDI portal
The following pages link to <i>N</i> by <i>N</i> Checkers is Exptime Complete (Q3316590):
Displayed 22 items.
- Phutball is PSPACE-hard (Q410721) (← links)
- An algorithmic analysis of the Honey-Bee game (Q714789) (← links)
- Turing machines with access to history (Q751802) (← links)
- A finite set of functions with an EXPTIME-complete composition problem (Q955009) (← links)
- Darwinian evolution in games with perfect information (Q1089281) (← links)
- Complexity of path-forming games (Q1210546) (← 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)
- 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)
- Backgammon is hard (Q2150573) (← links)
- QUIXO is EXPTIME-complete (Q2203590) (← links)
- The computational complexity of Angry Birds (Q2302303) (← links)
- On the fairness and complexity of generalized \(k\)-in-a-row games (Q2456362) (← links)
- (Q3305729) (← links)
- Restricted Power - Computational Complexity Results for Strategic Defense Games (Q3305735) (← links)
- Classifying the computational complexity of problems (Q3781088) (← links)
- Lower bounds for multiplayer noncooperative games of incomplete information (Q5948765) (← links)
- Computer Go: An AI oriented survey (Q5958709) (← links)
- On the complexity of computational problems associated with simple stochastic games (Q6184676) (← links)