Zobrazeno 1 - 10
of 395
pro vyhledávání: '"Huang, Neng"'
We prove a hardness of sampling result for the anti-ferromagnetic Ising model on random graphs of average degree $d$ for large constant $d$, proving that when the normalized inverse temperature satisfies $\beta>1$ (asymptotically corresponding to the
Externí odkaz:
http://arxiv.org/abs/2409.03974
Austrin showed that the approximation ratio $\beta\approx 0.94016567$ obtained by the MAX 2-SAT approximation algorithm of Lewin, Livnat and Zwick (LLZ) is optimal modulo the Unique Games Conjecture (UGC) and modulo a Simplicity Conjecture that state
Externí odkaz:
http://arxiv.org/abs/2310.12911
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 Sellke for Maximum Cut [arXiv:2111.06813] through a connection between ran
Externí odkaz:
http://arxiv.org/abs/2310.01563
Assuming the Unique Games Conjecture (UGC), the best approximation ratio that can be obtained in polynomial time for the MAX CUT problem is $\alpha_{\text{CUT}}\simeq 0.87856$, obtained by the celebrated SDP-based approximation algorithm of Goemans a
Externí odkaz:
http://arxiv.org/abs/2212.11191
Publikováno v:
In Pain Management Nursing August 2024 25(4):377-388
Autor:
Lou, Jiaqi, Cui, Shengyong, Huang, Neng, Jin, Guoying, Chen, Cui, Fan, Youfen, Zhang, Chun, Li, Jiliang
Publikováno v:
In Clinical Nutrition ESPEN February 2024 59:48-62
Autor:
Lou, Jiaqi, Fan, Youfen, Cui, Shengyong, Huang, Neng, Jin, Guoying, Chen, Cui, Zhang, Chun, Li, Jiliang
Publikováno v:
In Burns February 2024 50(1):93-105
MAX NAE-SAT is a natural optimization problem, closely related to its better-known relative MAX SAT. The approximability status of MAX NAE-SAT is almost completely understood if all clauses have the same size $k$, for some $k\ge 2$. We refer to this
Externí odkaz:
http://arxiv.org/abs/2009.10677
Publikováno v:
In Current Opinion in Chemical Engineering December 2023 42
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.