Reinforced Generation of Combinatorial Structures: Hardness of Approximation
Ansh Nagda, Prabhakar Raghavan, Abhradeep Thakurta
AI use, as the source states it
“We provide evidence towards answering this in the affirmative, using AlphaEvolve (an LLM code mutation agent) to obtain new results in three settings: a) We improve a recent result of Kunisky and Yu to obtain near-optimal upper and (conditional) lower bounds on certification algorithms for MAX-CUT and MAX-Independent Set on random 3- and 4-regular graphs.”
Model: AlphaEvolve, as stated
Named here, or see a mistake? Write to privacy@papex.org.