3 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.CC2023
Tight approximability of MAX 2-SAT and relatives, under UGC
Joshua Brakensiek, Neng Huang, Uri Zwick
Austrin showed that the approximation ratio obtained by the MAX 2-SAT approximation algorithm of Lewin, Livnat and Zwick (LLZ) is optimal modulo the Unique Ga…
quant-ph2023★ 3 cited
Local algorithms and the failure of log-depth quantum advantage on sparse random CSPs
Antares Chen, Neng Huang, Kunal Marwaha
We construct and analyze a message-passing algorithm for random constraint satisfaction problems (CSPs) at large clause density, generalizing work of El Alaoui, Montanari, and Sell…