20 citations · 42 across the 28 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2026
Sharp Hardness for MAX-3-CUT and Quantum MAX-CUT
Steven Heilman
Assuming the Unique Games Conjecture, we show it is NP-hard to approximate MAX-3-CUT within a multiplicative factor of for every , where is th…
cs.CC2012★ 1 cited
Euclidean Partitions Optimizing Noise Stability
Steven Heilman
The Standard Simplex Conjecture of Isaksson and Mossel asks for the partition of into pieces of equal Gaussian measure of optimal…
cs.CC2011★ 2 cited
Solution of the propeller conjecture in
Steven Heilman, Aukosh Jagannath, Assaf Naor
It is shown that every measurable partition of satisfies Let ${P_1,P_2…