Sangxia Huang

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Semi-supervised algorithms for approximately optimal and accurate clustering (available as arXiv preprint)	2021-07-28	Paper
Small extended formulation for knapsack cover inequalities from monotone circuits Theory of Computing	2019-01-31	Paper
Small extended formulation for knapsack cover inequalities from monotone circuits Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms	2018-07-16	Paper
A dichotomy for real weighted Holant problems Computational Complexity	2016-03-21	Paper
Approximation resistance on satisfiable instances for predicates with few accepting inputs Theory of Computing	2015-02-03	Paper
Approximation resistance on satisfiable instances for predicates with few accepting inputs Proceedings of the forty-eighth annual ACM symposium on Theory of Computing	2014-08-07	Paper
Improved hardness of approximating chromatic number Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques	2013-10-04	Paper
From Holant to \#CSP and back: dichotomy for Holant\(^{c}\) problems Algorithmica	2013-01-28	Paper
The complexity of weighted Boolean \#CSP modulo \(k\)	2012-01-23	Paper
From Holant to \#CSP and back: dichotomy for Holant\(^{c }\) problems Algorithms and Computation	2010-12-09	Paper

Research outcomes over time

This page was built for person: Sangxia Huang