Follow
Ning Tan
Ning Tan
Graduate Student of Computer Science, UC Berkeley
Verified email at berkeley.edu
Title
Cited by
Cited by
Year
Approximating CSPs with global cardinality constraints using SDP hierarchies
P Raghavendra, N Tan
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
1272012
On the power of symmetric LP and SDP relaxations
JR Lee, P Raghavendra, D Steurer, N Tan
2014 IEEE 29th Conference on Computational Complexity (CCC), 13-21, 2014
222014
On the power of Lasserre SDP hierarchy
N Tan
UC Berkeley, 2015
12015
Investigation of Techniques to Model and Reduce Latencies in Partial Quorum Systems
W Chow, N Tan
2012
CONSTRAINT SATISFACTION PROBLEMS WITH GLOBAL CONSTRAINTS
N TAN, ABYP RAGHAVENDRA
The system can't perform the operation now. Try again later.
Articles 1–5