基本信息
夏盟佶  男  博导  中国科学院软件研究所
电子邮件: mingji@ios.ac.cn
通信地址: 中科院软件所 计算机科学实验室
邮政编码: 100190

研究领域

计数复杂性、张量网络

招生信息

   
招生专业
081202-计算机软件与理论
招生方向
算法和计算复杂性

教育背景

2002-09--2008-07   中国科学院软件研究所   博士
1998-09--2002-07   山东师范大学   学士

工作经历

   
2018-09~现在, 中国科学院软件研究所, 研究员
2011-10~2013-10,德国马普信息研究所, 博士后
2009-05~2018-09,中国科学院软件研究所, 助理研究员、副研究员
2008-08~2009-04,美国威斯康星大学, 研究助理

教授课程

高级算法设计与分析

专利与奖励

   
奖励信息
(1) 中国科学院软件研究所优秀毕业生, , 研究所(学校), 2008
(2) 中国科学院院长优秀奖, , 研究所(学校), 2008

出版信息

   
发表论文
[1] Radu Curticapean, 夏盟佶. Parameterizing the Permanent: Hardness for fixed excluded minors. 5th Symposium on Simplicity in Algorithmsnull. 2022, [2] Cai, JinYi, Lu, Pinyan, Xia, Mingji. Dichotomy for Holant*Problems on the Boolean Domain. THEORY OF COMPUTING SYSTEMS[J]. 2020, 64(8): 1362-1391, https://www.webofscience.com/wos/woscc/full-record/WOS:000542053300001.
[3] Wang, Shaojiang, He, Kun, Pan, Yicheng, Xia, Mingji. Rectangle Transformation Problem. ALGORITHMICA[J]. 2019, 81(7): 2876-2898, [4] Cai JinYi, Lu Pinyan, Xia Mingji, Assoc Comp Machinery. Dichotomy for Real Holant(c) Problems. SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMSnull. 2018, 1802-1821, http://apps.webofknowledge.com/CitedFullRecord.do?product=UA&colName=WOS&SID=5CCFccWmJJRAuMzNPjj&search_mode=CitedFullRecord&isickref=WOS:000483921200119.
[5] Cai, JinYi, Fu, Zhiguo, Xia, Mingji. Complexity classification of the six-vertex model. INFORMATION AND COMPUTATION[J]. 2018, 259: 130-141, http://dx.doi.org/10.1016/j.ic.2018.01.003.
[6] Cai, JinYi, Lu, Pinyan, Xia, Mingji. HOLOGRAPHIC ALGORITHMS WITH MATCHGATES CAPTURE PRECISELY TRACTABLE PLANAR #CSP. SIAM JOURNAL ON COMPUTING[J]. 2017, 46(3): 853-889, https://www.webofscience.com/wos/woscc/full-record/WOS:000404774300001.
[7] 季铮锋, 夏盟佶. 计算的极限. 科学通报[J]. 2016, 61(4/5): 404-408, [8] Miltzow, Tillmann, Schmidt, Jens M, Xia, Mingji. Counting K-4-subdivisions. DISCRETE MATHEMATICS[J]. 2015, 338(12): 2387-2392, https://www.webofscience.com/wos/woscc/full-record/WOS:000359955700026.
[9] Cai, JinYi, Lu, Pinyan, Xia, Mingji. The complexity of complex weighted Boolean #CSP. JOURNAL OF COMPUTER AND SYSTEM SCIENCES[J]. 2014, 80(1): 217-236, https://www.webofscience.com/wos/woscc/full-record/WOS:000325386500016.
[10] Cai, JinYi, Lu, Pinyan, Xia, Mingji. Holographic reduction, interpolation and hardness. COMPUTATIONAL COMPLEXITY[J]. 2012, 21(4): 573-604, https://www.webofscience.com/wos/woscc/full-record/WOS:000310245900002.
[11] Cai JinYi, Lu Pinyan, Xia Mingji, SIAM, ACM. Dichotomy for Holant* Problems of Boolean Domain. PROCEEDINGS OF THE TWENTY-SECOND ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMSnull. 2011, 1714-1728, http://apps.webofknowledge.com/CitedFullRecord.do?product=UA&colName=WOS&SID=5CCFccWmJJRAuMzNPjj&search_mode=CitedFullRecord&isickref=WOS:000296182400132.
[12] Cai, JinYi, Lu, Pinyan, Xia, Mingji. COMPUTATIONAL COMPLEXITY OF HOLANT PROBLEMS. SIAM JOURNAL ON COMPUTING[J]. 2011, 40(4): 1101-1132, https://www.webofscience.com/wos/woscc/full-record/WOS:000294296100006.
[13] Cai JinYi, Lu Pinyan, Xia Mingji. Holographic algorithms with matchgates capture precisely tractable planar #csp. Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS[J]. 2010, 427-436, http://124.16.136.157/handle/311060/8788.
[14] Xia Mingji. Holographic reduction: a domain changed application and its partial converse theorems. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)[J]. 2010, 666-677, http://124.16.136.157/handle/311060/8790.
[15] Cai JinYi, Lu Pinyan, Xia Mingji, ACM. Holant Problems and Counting CSP. STOC'09: PROCEEDINGS OF THE 2009 ACM SYMPOSIUM ON THEORY OF COMPUTINGnull. 2009, 715-724, [16] Li Angsheng, Xia Mingji, Albers S, Weil P. A theory for Valiant's matchcircuits (extended abstract). STACS 2008: PROCEEDINGS OF THE 25TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCEnull. 2008, 491-502, http://apps.webofknowledge.com/CitedFullRecord.do?product=UA&colName=WOS&SID=5CCFccWmJJRAuMzNPjj&search_mode=CitedFullRecord&isickref=WOS:000254982900041.
[17] 夏盟佶. 若干计数问题的复杂性研究. 2008, http://124.16.136.157/handle/311060/6744.
[18] Xia, Mingji, Zhang, Peng, Zhao, Wenbo. Computational complexity of counting problems on 3-regular planar graphs. THEORETICAL COMPUTER SCIENCE[J]. 2007, 384(1): 111-125, http://dx.doi.org/10.1016/j.tcs.2007.05.023.