Preprint in the OpenAI Math release
A Direct Proof of Optimal Max-Cut Hardness
OpenAI
Abstract
We prove that approximating Max-Cut on simple unweighted graphs within any fixed factor greater than the Goemans–Williamson constant is NP-hard.
open until 1 Jan 2028
est. 50% chance this result is independently verified by the end of 2027.
Not verified 50%Verified 50%
What do you think this paper will get?
All positions stay anonymous.
Discussion (0)
Sign in to comment.