Author:
Mo Xu,Wang Weizhi,Yang Shuaikang,Wang Yunxiang,Geng Yiming
Reference10 articles.
1. The computational complexity of evil hangman;Barbay,2020
2. Approximation hardness of dominating set problems in bounded degree graphs
3. Mastermind is np-complete;Stuckman;arXiv: cs/0512049 [cs.CC],2005
4. Advances in Computer Games
5. Fun with Algorithms