Are even nearly satisfiable Unique Games hard to approximate?
@anujdawar.bsky.social writes the excerpt below in a discussion related to Unique Games. Read the source for the surrounding context.
“And the 4-to-1 conjecture also implies the approximate graph colouring conjecture!”
@ccanonne.github.io writes the excerpt below in a discussion related to Unique Games. Read the source for the surrounding context.
“the perfect completeness version of the (not) Unique Games Conjecture, the 4-to-1 Games conjecture!”
u/dnrlk writes the excerpt below in a discussion related to Unique Games. Read the source for the surrounding context.
“Some people were guessing UGC in the twitter comments, without giving any reason/evidence.”
Scott Aaronson reports hearing that AI companies are withholding major theoretical computer science results. He does not identify UGC; a commenter on the post separately suggests it.
“now sitting on solutions to some very major problems”
Fei, Minzer and Wang posted a perfect-completeness result for 4-to-1 Games. The authors say rumors influenced the timing of their release.
A thread links Fei, Minzer and Wang's paper and discusses the authors' release note, AI competition, and what the result means for approximation research.
In a thread about Aaronson's broader AI-results rumors, a pseudonymous commenter says a UGC rumor is circulating in the theory community. No lab, manuscript, or supporting evidence is supplied.
“There’s a rumor around the UGC in the theory community, Curran did not spread this”
The discussion of Aaronson's post includes a commenter repeating his account of labs holding back results. It provides another place to follow reactions to the same underlying report.