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. || toc =Selected Publications=
 * Home * People * Qiang Gao**
 * [[image:QiangGao.jpg]] ||~ || **Qiang Gao**,
 * Qiang Gao ||~ ||^ ||
 * 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)
 * Qiang Gao, Xinhe Xu (**2015**). //Research on the Computational Complexity of n x n Chinese Chess//. ICGA Journal, Vol. 38, No. 1
 * Qiang Gao (**2017**). //New Level, New Beginning: the 2015 NSCGT-CCGC Tournament//. ICGA Journal, Vol. 39, No. 1

=References= =What links here?= include page="Qiang Gao" component="backlinks" limit="20"
 * Up one level**