25,161
edits
Changes
Created page with "'''Home * People * Qiang Gao''' border|right|thumb| Qiang Gao <ref>Image from [[Qiang Gao, Xinhe Xu ('''2014'''). ''[http://tis.h..."
'''[[Main Page|Home]] * [[People]] * Qiang Gao'''
[[FILE:QiangGao.jpg|border|right|thumb| Qiang Gao <ref>Image from [[Qiang Gao]], [[Xinhe Xu]] ('''2014'''). ''[http://tis.hrbeu.edu.cn/oa/DArticle.aspx?type=view&id=20140502 Research on Time Complexity and Space Complexity]''. CAAI Transactions on Intelligent Systems, Vol. 9, No. 5, 过刊查询 - 《智能系统学报》编辑部 (Chinese with English abstract)</ref> ]]
'''Qiang Gao''',<br/>
a Chinese computer scientist and lecturer at College of Information Science and Engineering, [https://en.wikipedia.org/wiki/Northeastern_University_%28China%29 Northeastern University], [https://en.wikipedia.org/wiki/Shenyang Shenyang].
His research interests include [https://en.wikipedia.org/wiki/Computational_complexity_theory computational complexity theory] and [https://en.wikipedia.org/wiki/Game_complexity game complexity], the main classes of [https://en.wikipedia.org/wiki/Time_complexity time complexity],
which are [https://en.wikipedia.org/wiki/P_%28complexity%29 P], [https://en.wikipedia.org/wiki/NP_%28complexity%29 NP], [https://en.wikipedia.org/wiki/NP-hardness NP-hard], [https://en.wikipedia.org/wiki/NP-completeness NP-complete] and [https://en.wikipedia.org/wiki/EXPTIME EXPTIME],
and the main classes of [https://en.wikipedia.org/wiki/DSPACE space complexity], that is [https://en.wikipedia.org/wiki/PSPACE PSCACE], NPSPACE, PSPACE-hard and [https://en.wikipedia.org/wiki/PSPACE-complete 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#38_1|ICGA Journal, Vol. 38, No. 1]] <ref>[[Qiang Gao]], [[Xinhe Xu]] ('''2015'''). ''Research on the Computational Complexity of n x n Chinese Chess''. [[ICGA Journal#38_1|ICGA Journal, Vol. 38, No. 1]]</ref>.
=Selected Publications=
* [[Qiang Gao]], [[Xinhe Xu]] ('''2014'''). ''[http://tis.hrbeu.edu.cn/oa/DArticle.aspx?type=view&id=20140502 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#38_1|ICGA Journal, Vol. 38, No. 1]]
* [[Qiang Gao]] ('''2017'''). ''New Level, New Beginning: the 2015 NSCGT-CCGC Tournament''. [[ICGA Journal#39_1|ICGA Journal, Vol. 39, No. 1]]
* [[Qiang Gao]], [[Zhonghu Yuan]], [[Xinhe Xu]], [[Lina Hao]], [[Ruimin Cao]] ('''2018'''). ''Rapid development of computer games in China''. [[ICGA Journal#40_4|ICGA Journal, Vol. 40, No. 4]]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Researcher|Gao]]
[[FILE:QiangGao.jpg|border|right|thumb| Qiang Gao <ref>Image from [[Qiang Gao]], [[Xinhe Xu]] ('''2014'''). ''[http://tis.hrbeu.edu.cn/oa/DArticle.aspx?type=view&id=20140502 Research on Time Complexity and Space Complexity]''. CAAI Transactions on Intelligent Systems, Vol. 9, No. 5, 过刊查询 - 《智能系统学报》编辑部 (Chinese with English abstract)</ref> ]]
'''Qiang Gao''',<br/>
a Chinese computer scientist and lecturer at College of Information Science and Engineering, [https://en.wikipedia.org/wiki/Northeastern_University_%28China%29 Northeastern University], [https://en.wikipedia.org/wiki/Shenyang Shenyang].
His research interests include [https://en.wikipedia.org/wiki/Computational_complexity_theory computational complexity theory] and [https://en.wikipedia.org/wiki/Game_complexity game complexity], the main classes of [https://en.wikipedia.org/wiki/Time_complexity time complexity],
which are [https://en.wikipedia.org/wiki/P_%28complexity%29 P], [https://en.wikipedia.org/wiki/NP_%28complexity%29 NP], [https://en.wikipedia.org/wiki/NP-hardness NP-hard], [https://en.wikipedia.org/wiki/NP-completeness NP-complete] and [https://en.wikipedia.org/wiki/EXPTIME EXPTIME],
and the main classes of [https://en.wikipedia.org/wiki/DSPACE space complexity], that is [https://en.wikipedia.org/wiki/PSPACE PSCACE], NPSPACE, PSPACE-hard and [https://en.wikipedia.org/wiki/PSPACE-complete 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#38_1|ICGA Journal, Vol. 38, No. 1]] <ref>[[Qiang Gao]], [[Xinhe Xu]] ('''2015'''). ''Research on the Computational Complexity of n x n Chinese Chess''. [[ICGA Journal#38_1|ICGA Journal, Vol. 38, No. 1]]</ref>.
=Selected Publications=
* [[Qiang Gao]], [[Xinhe Xu]] ('''2014'''). ''[http://tis.hrbeu.edu.cn/oa/DArticle.aspx?type=view&id=20140502 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#38_1|ICGA Journal, Vol. 38, No. 1]]
* [[Qiang Gao]] ('''2017'''). ''New Level, New Beginning: the 2015 NSCGT-CCGC Tournament''. [[ICGA Journal#39_1|ICGA Journal, Vol. 39, No. 1]]
* [[Qiang Gao]], [[Zhonghu Yuan]], [[Xinhe Xu]], [[Lina Hao]], [[Ruimin Cao]] ('''2018'''). ''Rapid development of computer games in China''. [[ICGA Journal#40_4|ICGA Journal, Vol. 40, No. 4]]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Researcher|Gao]]
