Konsti Wohlwend(@konstiwohlwend):The complexity theory result is actually huge. P problems can be solved in polynomial time. It was widely believed that NP-complete problems require exponential time. P = NP states that NP-complete problems can be solved in polynomial time. OpenAI didn't prove that. But, they proved that (some) NP-complete problems can be solved faster than exponential time, meaning: - P = NP, or - the complexity of NP problems is a "middle thing" between polynomial and exponential, eg. O(n^log n) If it survives peer reviews, this could be one of the biggest CS breakthroughs in decades.

Konsti Wohlwend

@konstiwohlwend

building @hexclave (yc s24) prev: 2x yc alum, intern @ google & jane street, icpc coach 🥈, ipho 16/17 ai, maths & building things ᕕ(⌐■_■)ᕗ 🇺🇸🇨🇭🇱🇮

参加 May 2016

974 フォロー中 3.2K ファン

Konsti Wohlwend@konstiwohlwend

2026.10.26 22:35

The complexity theory result is actually huge. P problems can be solved in polynomial time. It was widely believed that NP-complete problems require exponential time. P = NP states that NP-complete problems can be solved in polynomial time. OpenAI didn't prove that. But, they proved that (some) NP-complete problems can be solved faster than exponential time, meaning: - P = NP, or - the complexity of NP problems is a "middle thing" between polynomial and exponential, eg. O(n^log n) If it survives peer reviews, this could be one of the biggest CS breakthroughs in decades.

2.5K

194

コミュニティへ転送

人気のあるユーザー