Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Mingji Xia
2010 – today
- 2013
[c13]Jin-Yi Cai, Pinyan Lu, Mingji Xia: Dichotomy for Holant* Problems with Domain Size 3. SODA 2013: 1278-1295- 2012
- [j6]Jin-Yi Cai, Pinyan Lu, Mingji Xia: Holographic reduction, interpolation and hardness. Computational Complexity 21(4): 573-604 (2012)
- [i4]Jin-Yi Cai, Pinyan Lu, Mingji Xia: Dichotomy for Holant* Problems with a Function on Domain Size 3. CoRR abs/1207.2354 (2012)
- 2011
- [j5]Mingji Xia: Holographic Reduction: A Domain Changed Application and its Partial Converse Theorems. Int. J. Software and Informatics 5(4): 567-577 (2011)
- [j4]Jin-yi Cai, Pinyan Lu, Mingji Xia: Computational Complexity of Holant Problems. SIAM J. Comput. 40(4): 1101-1132 (2011)
- [j3]Jin-yi Cai, Pinyan Lu, Mingji Xia: A computational proof of complexity of some restricted counting problems. Theor. Comput. Sci. 412(23): 2468-2485 (2011)
- [c12]Jin-yi Cai, Pinyan Lu, Mingji Xia: Dichotomy for Holant* Problems of Boolean Domain. SODA 2011: 1714-1728
- [c11]Heng Guo, Sangxia Huang, Pinyan Lu, Mingji Xia: The Complexity of Weighted Boolean #CSP Modulo k. STACS 2011: 249-260
- 2010
- [c10]Jin-yi Cai, Pinyan Lu, Mingji Xia: Holographic Algorithms with Matchgates Capture Precisely Tractable Planar_#CSP. FOCS 2010: 427-436
- [c9]Mingji Xia: Holographic Reduction: A Domain Changed Application and Its Partial Converse Theorems. ICALP (1) 2010: 666-677
- [i3]Jin-yi Cai, Pinyan Lu, Mingji Xia: Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP. CoRR abs/1008.0683 (2010)
2000 – 2009
- 2009
- [j2]Peng Zhang, Mingji Xia: An approximation algorithm to the k-Steiner Forest problem. Theor. Comput. Sci. 410(11): 1093-1098 (2009)
- [c8]Byron J. Gao, Mingji Xia, Walter Cai, David C. Anastasiu: The gardener's problem for web information monitoring. CIKM 2009: 1525-1528
- [c7]Walter Cai, David C. Anastasiu, Mingji Xia, Byron J. Gao: OLAP For Multicriteria Maintenance Scheduling. DMIN 2009: 35-41
- [c6]
- [c5]Jin-yi Cai, Pinyan Lu, Mingji Xia: A Computational Proof of Complexity of Some Restricted Counting Problems. TAMC 2009: 138-149
- 2008
- [c4]Jin-yi Cai, Pinyan Lu, Mingji Xia: Holographic Algorithms by Fibonacci Gates and Holographic Reductions for Hardness. FOCS 2008: 644-653
- [c3]Angsheng Li, Mingji Xia: A Theory for Valiant's Matchcircuits (Extended Abstract). STACS 2008: 491-502
- [i2]Jin-yi Cai, Pinyan Lu, Mingji Xia: A Family of Counter Examples to an Approach to Graph Isomorphism. CoRR abs/0801.1766 (2008)
- [i1]Angsheng Li, Mingji Xia: A Theory for Valiant's Matchcircuits (Extended Abstract). CoRR abs/0802.2860 (2008)
- 2007
- [j1]Mingji Xia, Peng Zhang, Wenbo Zhao: Computational complexity of counting problems on 3-regular planar graphs. Theor. Comput. Sci. 384(1): 111-125 (2007)
- [c2]
- 2006
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-14 22:05 CEST by the dblp team