夏盟佶      Xia, Mingji
夏盟佶 Xia, Mingji
Verified email at ios.ac.cn
Title
Cited by
Cited by
Year
Holant problems and counting CSP
JY Cai, P Lu, M Xia
Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009
1072009
Holographic algorithms by fibonacci gates and holographic reductions for hardness
JY Cai, P Lu, M Xia
2008 49th Annual IEEE Symposium on Foundations of Computer Science, 644-653, 2008
762008
Computational complexity of counting problems on 3-regular planar graphs
M Xia, P Zhang, W Zhao
Theoretical Computer Science 384 (1), 111-125, 2007
712007
Computational complexity of Holant problems
JY Cai, P Lu, M Xia
SIAM Journal on Computing 40 (4), 1101-1132, 2011
582011
The complexity of complex weighted Boolean# CSP
JY Cai, P Lu, M Xia
Journal of Computer and System Sciences 80 (1), 217-236, 2014
552014
Holographic algorithms with matchgates capture precisely tractable planar_# csp
JY Cai, P Lu, M Xia
2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 427-436, 2010
552010
Dichotomy for Holant* problems of Boolean domain
JY Cai, P Lu, M Xia
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011
482011
Holographic reduction, interpolation and hardness
JY Cai, P Lu, M Xia
Computational Complexity 21 (4), 573-604, 2012
232012
Holographic algorithms by Fibonacci gates
JY Cai, P Lu, M Xia
Linear Algebra and its Applications 438 (2), 690-707, 2013
202013
Dichotomy for Real Holantc Problems
JY Cai, P Lu, M Xia
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
182018
Dichotomy for Holant Problems with a Function on Domain Size 3
JY Cai, P Lu, M Xia
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete …, 2013
172013
A computational proof of complexity of some restricted counting problems
JY Cai, P Lu, M Xia
International Conference on Theory and Applications of Models of Computation …, 2009
172009
Parameterizing the permanent: Genus, apices, minors, evaluation mod 2k
R Curticapean, M Xia
2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 994-1009, 2015
152015
Complexity classification of the six-vertex model
JY Cai, Z Fu, M Xia
Information and Computation 259, 130-141, 2018
142018
# 3-regular bipartite planar vertex cover is# P-complete
M Xia, W Zhao
International Conference on Theory and Applications of Models of Computation …, 2006
142006
A computational proof of complexity of some restricted counting problems
JY Cai, P Lu, M Xia
Theoretical computer science 412 (23), 2468-2485, 2011
132011
Holographic algorithms with matchgates capture precisely tractable planar# CSP
JY Cai, P Lu, M Xia
SIAM Journal on Computing 46 (3), 853-889, 2017
112017
Variable-Version Lovász Local Lemma: Beyond Shearer's Bound
K He, L Li, X Liu, Y Wang, M Xia
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
72017
A Theory for Valiant's Matchcircuits
A Li, M Xia
arXiv preprint arXiv:0802.2860, 2008
52008
A Theory for Valiant's Matchcircuits
A Li, M Xia
arXiv preprint arXiv:0802.2860, 2008
52008
The system can't perform the operation now. Try again later.
Articles 1–20