38 citations · 171 across the 26 of their papers we have counts for
Showing 2019 · cs.CCShow all
2 papers · 2 filters
cs.CC2019
Extended Formulation Lower Bounds for Refuting Random CSPs
Jonah Brown-Cohen, Prasad Raghavendra
Random constraint satisfaction problems (CSPs) such as random -SAT are conjectured to be computationally intractable. The average case hardness of random -SAT and other CSPs…
cs.CC2019★ 5 cited
Lifting Sum-of-Squares Lower Bounds: Degree- to Degree-
Sidhanth Mohanty, Prasad Raghavendra, Jeff Xu
The degree- Sum-of-Squares (SoS) SDP relaxation is a powerful algorithm that captures the best known polynomial time algorithms for a broad range of problems including MaxCut, S…