Qiang Gao

From Chessprogramming wiki
Jump to: navigation, search

Home * People * Qiang Gao

Qiang Gao [1]

Qiang Gao,
a Chinese computer scientist and lecturer at College of Information Science and Engineering, Northeastern University, Shenyang. His research interests include computational complexity theory and game complexity, the main classes of time complexity, which are P, NP, NP-hard, NP-complete and EXPTIME, and the main classes of space complexity, that is PSCACE, NPSPACE, PSPACE-hard and PSPACE-complete. In particular, he researched on the computational complexity of n x n Chinese Chess as published along with Xinhe Xu in the ICGA Journal, Vol. 38, No. 1 [2].

Selected Publications


  1. Image from Qiang Gao, Xinhe Xu (2014). Research on Time Complexity and Space Complexity. CAAI Transactions on Intelligent Systems, Vol. 9, No. 5, 过刊查询 - 《智能系统学报》编辑部 (Chinese with English abstract)
  2. Qiang Gao, Xinhe Xu (2015). Research on the Computational Complexity of n x n Chinese Chess. ICGA Journal, Vol. 38, No. 1

Up one level