13 citations · 14 across the 3 of their papers we have counts for
1 paper · 1 filter
Hamoon Mousavi, Taro Spirig
After the NP-hardness of computational problems such as 3SAT and MaxCut was established, a natural next step was to explore whether these problems remain hard to approximate. While…