3 citations · 4 across the 3 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2018★ 1 cited
Near-optimal approximation algorithm for simultaneous Max-Cut
Amey Bhangale, Subhash Khot, Swastik Kopparty +2
In the simultaneous Max-Cut problem, we are given weighted graphs on the same set of vertices, and the goal is to find a cut of the vertex set so that the minimum, over the…
cs.CC2017
An Improved Dictatorship Test with Perfect Completeness
Amey Bhangale, Subhash Khot, Devanathan Thiruvenkatachari
A Boolean function is called a dictator if it depends on exactly one variable i.e for some . In this wor…