Gobang ist PSPACE-vollst�ndig
Acta Informatica1980Vol. 13(1), pp. 59–66
Citations Over TimeTop 10% of 1980 papers
Related Papers
- → Hex ist PSPACE-vollst�ndig(1981)106 cited
- → PSPACE-hardness of some combinatorial games(1987)29 cited
- → Game Values and Computational Complexity: An Analysis via Black-White Combinatorial Games(2015)6 cited
- → Amazons is PSPACE-complete(2005)5 cited
- A Unified Approach for Proving Both Easiness and Hardness Results for Succinct Specifications (Preliminary Version)(1995)