||Osquars Backe 2, floor 5, room 1526
|SE-100 44, Stockholm
||Phone: +46 8 790 96 90
||E-mail: huang dot sangxia at gmail
I'm a graduate
student at CSC,
my advisor is Prof. Johan Håstad.
I'm interested in computational complexity, and in particular, the approximability
of combinatorial optimization problems.
I did my undergraduate studies at
Shanghai Jiao Tong University.
I had also worked as an intern student at
Theory Group of Microsoft Research Asia, supervised by
Dr. Pinyan Lu.
During the fall semester of 2013, I visited
Prof. Ryan O'Donnell
at Carnegie Mellon University.
I also did a summer internship at
Toyota Technological Institute at Chicago
with Prof. Madhur Tulsiani
June - August, 2014.
I'm graduating in summer 2015.
Improved NP-inapproximability for 2-variable linear equations,
with Johan Håstad, Rajsekar Manokaran, Ryan O'Donnell and John Wright.
Improved Hardness of Approximating Chromatic Number.
Approximation Resistance on Satisfiable Instances
for Predicates with Few Accepting Inputs.
Theory of Computing 10(14), 2014, 359--388.
Preliminary version in STOC 2013.
A Dichotomy for Real Weighted Holant Problems,
with Pinyan Lu,
The Complexity of Weighted Boolean #CSP Modulo k,
with Heng Guo, Pinyan Lu and Mingji Xia,
From Holant To #CSP And Back: Dichotomy For Holantc Problems,
with Jin-Yi Cai and Pinyan Lu,
Algorithmica 64(3): 511--533, 2012.
Preliminary version in ISAAC 2010 (best paper).