Search this site
Embedded Files
Skip to main content
Skip to navigation
Sangxia Huang
Sangxia Huang
A Dichotomy for Real Weighted Holant Problems
Approximation Resistance on Satisfiable Instances for Predicates with Few Accepting Inputs
exp((logn)^(1/10-o(1))) Hardness for Hypergraph Coloring
From Holant To #CSP And Back: Dichotomy For Holant^c Problems
Improved Hardness of Approximating Chromatic Number
Improved NP-inapproximability for 2-variable linear equations
Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits
The Complexity of Weighted Boolean #CSP Modulo k
Thesis: Hardness of Constraint Satisfaction and Hypergraph Coloring
test
Sangxia Huang
test
Google Sites
Report abuse
Google Sites
Report abuse