Mingji Xia

Proceedings of the 5th Symposium on Simplicity in Algorithms, 2022

2021

Parameterizing the Permanent: Hardness for K8-minor-free graphs.

[BibT_eX]

[DOI]

CoRR, 2021

2020

Dichotomy for Holant∗ Problems on the Boolean Domain.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2020

Computing Linear Arithmetic Representation of Reachability Relation of One-Counter Automata.

[BibT_eX]

[DOI]

Proceedings of the Dependable Software Engineering. Theories, Tools, and Applications, 2020

2019

Rectangle Transformation Problem.

[BibT_eX]

[DOI]

Algorithmica, 2019

2018

Complexity classification of the six-vertex model.

[BibT_eX]

[DOI]

Zhiguo Fu

Inf. Comput., 2018

Splitting and jump inversion in the Turing degrees.

[BibT_eX]

[DOI]

Angsheng Li

Comput., 2018

Dichotomy for Real Holantc Problems.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017

Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP.

[BibT_eX]

[DOI]

SIAM J. Comput., 2017

Dichotomy for Real Holantc Problems.

[BibT_eX]

[DOI]

CoRR, 2017

Variable-Version Lovász Local Lemma: Beyond Shearer's Bound.

[BibT_eX]

[DOI]

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016

Holographic Algorithms.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Base collapse of holographic algorithms.

[BibT_eX]

[DOI]

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

2015

Counting K4-subdivisions.

[BibT_eX]

[DOI]

Tillmann Miltzow

Jens M. Schmidt

Discret. Math., 2015

Parameterizing the Permanent: Genus, Apices, Minors, Evaluation mod 2^k.

[BibT_eX]

[DOI]

CoRR, 2015

Parameterizing the Permanent: Genus, Apices, Minors, Evaluation Mod 2k.

[BibT_eX]

[DOI]

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014

The complexity of complex weighted Boolean #CSP.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2014

Counting K_4-Subdivisions.

[BibT_eX]

[DOI]

Tillmann Miltzow

Jens M. Schmidt

CoRR, 2014

2013

Dichotomy for Holant* Problems with Domain Size 3.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012

Dichotomy for Holant* Problems with a Function on Domain Size 3

[BibT_eX]

[DOI]

CoRR, 2012

Holographic reduction, interpolation and hardness.

[BibT_eX]

[DOI]

Comput. Complex., 2012

2011

A computational proof of complexity of some restricted counting problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Computational Complexity of Holant Problems.

[BibT_eX]

[DOI]

SIAM J. Comput., 2011

Holographic Reduction: A Domain Changed Application and its Partial Converse Theorems.

[BibT_eX]

[DOI]

Int. J. Softw. Informatics, 2011

The Complexity of Weighted Boolean #CSP Modulo k.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

Dichotomy for Holant* Problems of Boolean Domain.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010

Holographic Algorithms with Matchgates Capture Precisely Tractable Planar_#CSP.

[BibT_eX]

[DOI]

Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

2009

An approximation algorithm to the k-Steiner Forest problem.

[BibT_eX]

[DOI]

Peng Zhang

Theor. Comput. Sci., 2009

Holant problems and counting CSP.

[BibT_eX]

[DOI]

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

OLAP For Multicriteria Maintenance Scheduling.

[BibT_eX]

Proceedings of The 2009 International Conference on Data Mining, 2009

The gardener's problem for web information monitoring.

[BibT_eX]

[DOI]

Proceedings of the 18th ACM Conference on Information and Knowledge Management, 2009

2008

A Family of Counter Examples to an Approach to Graph Isomorphism

[BibT_eX]

[DOI]

CoRR, 2008

A Theory for Valiant's Matchcircuits (Extended Abstract).

[BibT_eX]

[DOI]

Angsheng Li

Proceedings of the STACS 2008, 2008

Holographic Algorithms by Fibonacci Gates and Holographic Reductions for Hardness.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2007

Computational complexity of counting problems on 3-regular planar graphs.

[BibT_eX]

[DOI]

Peng Zhang

Wenbo Zhao

Theor. Comput. Sci., 2007

Maximum Edge-Disjoint Paths Problem in Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2007

2006

#3-Regular Bipartite Planar Vertex Cover is #P-Complete.

[BibT_eX]

[DOI]