Follow
Neng Huang
Neng Huang
Verified email at uchicago.edu - Homepage
Title
Cited by
Cited by
Year
On the Mysteries of MAX NAE-SAT
J Brakensiek, N Huang, A Potechin, U Zwick
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
62021
Local algorithms and the failure of log-depth quantum advantage on sparse random CSPs
A Chen, N Huang, K Marwaha
arXiv preprint arXiv:2310.01563, 2023
52023
Separating MAX 2-AND, MAX DI-CUT and MAX CUT
J Brakensiek, N Huang, A Potechin, U Zwick
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023
42023
On the Approximability of Presidential Type Predicates
N Huang, A Potechin
International Conference on Approximation Algorithms for Combinatorial …, 2020
32020
Tight approximability of MAX 2-SAT and relatives, under UGC
J Brakensiek, N Huang, U Zwick
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
2024
On the Decision Tree Complexity of String Matching
X He, N Huang, X Sun
26th Annual European Symposium on Algorithms (ESA 2018), 2018
2018
The system can't perform the operation now. Try again later.
Articles 1–6