2 citations · 4 across the 4 of their papers we have counts for
4 papers
A Note on Computational Complexity of Kill-all Go
Zhujun Zhang
Kill-all Go is a variant of Go in which Black tries to capture all white stones, while White tries to survive. We consider computational complexity of Kill-all Go with two rulesets…
A Note on Computational Complexity of Dou Shou Qi
Zhujun Zhang
Dou Shou Qi is a Chinese strategy board game for two players. We use a EXPTIME-hardness framework to analyse computational complexity of the game. We construct all gadgets of the h…
A Note on Hardness Frameworks and Computational Complexity of Xiangqi and Janggi
Zhujun Zhang
We review NP-hardness framework and PSPACE-hardness framework for a type of 2D platform games. We introduce a EXPTIME-hardness framework by defining some new gadgets. We use these…
A Note on Counting Dependency Trees
Zhujun Zhang
We apply symbolic method to deduce functional equation which generating function of counting sequence of dependency trees must satisfy. Then we use Lagrange inversion theorem to ob…