註冊並分享邀請連結,可獲得影片播放與邀請獎勵。

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 粉絲
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.
顯示更多
0
56
2.5K
194
轉發到社區