2 citations · 2 across the 5 of their papers we have counts for
1 paper · 1 filter
Per Austrin, Subhash Khot
A constraint satisfaction problem (CSP) is said to be \emph{approximation resistant} if it is hard to approximate better than the trivial algorithm which picks a uniformly random a…