4 citations · 7 across the 6 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DS2015
Amplification and Derandomization Without Slowdown
Ofer Grossman, Dana Moshkovitz
We present techniques for decreasing the error probability of randomized algorithms and for converting randomized algorithms to deterministic (non-uniform) algorithms. Unlike most…
cs.DS2015
Approximating Dense Max 2-CSPs
Pasin Manurangsi, Dana Moshkovitz
In this paper, we present a polynomial-time algorithm that approximates sufficiently high-value Max 2-CSPs on sufficiently dense graphs to within approximation…