| Holant problems and counting CSP JY Cai, P Lu, M Xia Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009 | 128 | 2009 |
| 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 | 91 | 2008 |
| The complexity of complex weighted Boolean# CSP JY Cai, P Lu, M Xia Journal of Computer and System Sciences 80 (1), 217-236, 2014 | 87 | 2014 |
| Computational complexity of counting problems on 3-regular planar graphs M Xia, P Zhang, W Zhao Theoretical Computer Science 384 (1), 111-125, 2007 | 79 | 2007 |
| Computational complexity of Holant problems JY Cai, P Lu, M Xia SIAM Journal on Computing 40 (4), 1101-1132, 2011 | 72 | 2011 |
| 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 | 67* | 2011 |
| 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 | 59 | 2010 |
| 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 | 37 | 2015 |
| Dichotomy for Real Holantc Problems JY Cai, P Lu, M Xia Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 35 | 2018 |
| A computational proof of complexity of some restricted counting problems JY Cai, P Lu, M Xia Theoretical computer science 412 (23), 2468-2485, 2011 | 30 | 2011 |
| Holographic reduction, interpolation and hardness JY Cai, P Lu, M Xia Computational Complexity 21 (4), 573-604, 2012 | 28 | 2012 |
| Complexity classification of the six-vertex model JY Cai, Z Fu, M Xia Information and Computation 259, 130-141, 2018 | 25 | 2018 |
| 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 | 25 | 2013 |
| Holographic algorithms with matchgates capture precisely tractable planar# CSP JY Cai, P Lu, M Xia SIAM Journal on Computing 46 (3), 853-889, 2017 | 23 | 2017 |
| Holographic algorithms by Fibonacci gates JY Cai, P Lu, M Xia Linear Algebra and its Applications 438 (2), 690-707, 2013 | 23 | 2013 |
| # 3-regular bipartite planar vertex cover is# P-complete M Xia, W Zhao International Conference on Theory and Applications of Models of Computation …, 2006 | 20 | 2006 |
| Holographic reduction: A domain changed application and its partial converse theorems M Xia International Colloquium on Automata, Languages, and Programming, 666-677, 2010 | 15 | 2010 |
| 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 | 14 | 2017 |
| Parameterizing the permanent: Hardness for fixed excluded minors R Curticapean, M Xia Symposium on Simplicity in Algorithms (SOSA), 297-307, 2022 | 8 | 2022 |
| Computing linear arithmetic representation of reachability relation of one-counter automata X Li, T Chen, Z Wu, M Xia International Symposium on Dependable Software Engineering: Theories, Tools …, 2020 | 8 | 2020 |
Pinyan LuITCS, Shanghai University of Finance and EconomicsVerified email at mail.shufe.edu.cn
