#NPHard
OpenAI’s Unique Games Claim Is Not P vs NP

A manuscript in OpenAI’s October 2026 mathematics release tackles Unique Games, a conjecture open for more than two decades.

#uniquegames #complexitytheory #nphard #lean
October 8, 2026 at 12:18 AM
We are now up to 1725 words in #EchoesOfTheVoid and got to spend time today looking into packing problems, where we came across the lovely phrase "This is an #NPHard problem" yup, the joys of Science Fiction. After some writing, we sent our love to @PunkinPai.bsky.social #RoyalRoadHereWeGo
September 24, 2026 at 10:52 PM
Do you find it intuitive why SAT is NPhard? (like 3sat with any number of literals per clause instead of 3). If yes then you can look up the proof that you can reduce any SAT to a 3SAT (fairly simple). If no then you have to squint a bit until you see that a SAT instance simulates a Turing machine.
January 10, 2025 at 11:44 PM
Researchers proved the unweighted one‑sided local crossing minimization problem is NP‑hard and that the median heuristic still gives a 3‑approximation, per a paper submitted Sep 30 2025. https://getnews.me/local-crossing-minimization-np-hard-median-heuristic-3-approx/ #graphdrawing #nphard
October 2, 2025 at 9:21 PM
New research proves the uniform secret‑protection problem is NP‑hard and a variant is Σ₂^P‑complete; the authors also present an ILP model that scales to realistic system sizes. Read more: https://getnews.me/new-study-shows-secret-protection-problem-is-np-hard/ #secretprotection #nphard #complexity
September 19, 2025 at 6:20 PM
Researchers have proved the Freeze-Tag Problem is strongly NP-hard when movement costs use Manhattan (L1) distance on a 2-D grid, settling a long-standing open question. https://getnews.me/freeze-tag-problem-proven-np-hard-for-2d-manhattan-distance/ #freezetag #nphard #robotics
September 19, 2025 at 6:16 PM
Researchers proved that finding ROABP ordering and testing GL_n equivalence are NP‑hard even for quadratic forms, and that approximating minimal width is also NP‑hard. Submitted September 2025. https://getnews.me/study-finds-np-hardness-of-roabp-order-finding-and-equivalence/ #roabp #nphard
September 18, 2025 at 5:19 PM
Wearing my scars proudly, cause yea I am a survivor 💪🏿💪🏿💪🏿

#ItsOfficial

Even if they are subtle

#AMindIsATerribleThingToWaste
#SubtleTechniques
#IntersexedRightsAreHumanRights
#NonbinaryProblems
#NPHard🎭🎭🎭🎭
#FauxMenT🙈🙉
Steven Universe: I Come From The Future Meme
ALT: Steven Universe: I Come From The Future Meme
static.klipy.com
July 8, 2026 at 2:20 PM
Decoding QC codes is NP-complete
(Ernesto Dominguez Fiallo, Pablo Freyre Arrozarena, Luis Ramiro Piñeiro) ia.cr/2023/1064
July 11, 2023 at 5:00 AM
Yale & U-Michigan researchers prove minimum-weight decoding is NP-hard for color code, surface code, and transversal CNOT variants via 3D matching reduction, establishing a fundamental scalability barrier for fault-tolerant QEC.

#QuantumErrorCorrection #NPHard #News
Minimum-Weight Decoding for Color & Surface Codes Proven NP-Hard
iq.fp2.dev
March 24, 2026 at 11:32 AM