1 citations · 2 across the 5 of their papers we have counts for
1 paper · 2 filters
Eliot Kapit, Brandon A. Barton, Sean Feeney +5
A canonical feature of the constraint satisfaction problems in NP is approximation hardness, where in the worst case, finding sufficient-quality approximate solutions is exponentia…