Termsslug: np-hard

NP-hard

NP 难

A class of computational problems at least as hard as the hardest problems in NP.

Curated Intelligence

1 items · Page 1/1
Hacker News AIT2·Models
95 pts
OpenAI Proves Unique Games Conjecture in Batch of 372 Math Results

OpenAI released 372 major mathematical results yesterday, including a complete proof of the Unique Games Conjecture (UGC), a central open problem in computational complexity theory. Recommended by an advisory board of distinguished mathematicians like Timothy Gowers, this breakthrough confirms that certain optimization problems cannot be approximated better than random guessing in polynomial time, marking a milestone for AI in formal reasoning and frontier mathematical discovery.