3 citations · 4 across the 5 of their papers we have counts for
3 papers · 1 filter
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…
Hypergraph Diffusions and Resolvents for Norm-Based Hypergraph Laplacians
Konstantinos Ameranis, Antares Chen, Adela DePavia +2
The development of simple and fast hypergraph spectral methods has been hindered by the lack of numerical algorithms for simulating heat diffusions and computing fundamental object…
Submodular Hypergraph Partitioning: Metric Relaxations and Fast Algorithms via an Improved Cut-Matching Game
Antares Chen, Lorenzo Orecchia, Erasmo Tani
Despite there being significant work on developing spectral, and metric embedding based approximation algorithms for hypergraph generalizations of conductance, little is known rega…