Sangxia HUANG
Sangxia HUANG
Bestätigte E-Mail-Adresse bei sony.com - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Adversarial attacks and defences competition
A Kurakin, I Goodfellow, S Bengio, Y Dong, F Liao, M Liang, T Pang, ...
The NIPS'17 Competition: Building Intelligent Systems, 195-231, 2018
1372018
From Holant to# CSP and back: Dichotomy for Holant c problems
JY Cai, S Huang, P Lu
Algorithmica 64 (3), 511-533, 2012
472012
A dichotomy for real weighted Holant problems
S Huang, P Lu
2012 IEEE 27th Conference on Computational Complexity, 96-106, 2012
35*2012
Improved hardness of approximating chromatic number
S Huang
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2013
282013
The Complexity of Weighted Boolean# CSP Modulo
H Guo, S Huang, P Lu, M Xia
272011
Pinyan Lu. A dichotomy for real weighted Holant problems
S Huang
IEEE Conference on Computational Complexity, 96-106, 2016
212016
Approximation resistance on satisfiable instances for predicates with few accepting inputs
S Huang
Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013
122013
Small extended formulation for knapsack cover inequalities from monotone circuits
A Bazzi, S Fiorini, S Huang, O Svensson
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
112017
Hardness for Hypergraph Coloring
S Huang
arXiv preprint arXiv:1504.03923, 2015
112015
Semi-supervised algorithms for approximately optimal and accurate clustering
B Gamlath, S Huang, O Svensson
arXiv preprint arXiv:1803.00926, 2018
72018
Improved NP-Inapproximability for -Variable Linear Equations
J Håstad, S Huang, R Manokaran, R O'Donnell, J Wright
Theory of Computing 13 (1), 1-51, 2017
52017
Approximation resistance on satisfiable instances for predicates strictly dominating parity
S Huang
52012
Hardness of Constraint Satisfaction and Hypergraph Coloring: Constructions of Probabilistically Checkable Proofs with Perfect Completeness
S Huang
KTH Royal Institute of Technology, 2015
2015
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–13