๊ฐ€์ž… ํ›„ ์ดˆ๋Œ€ ๋งํฌ๋ฅผ ๊ณต์œ ํ•˜๋ฉด ๋™์˜์ƒ ์žฌ์ƒ ๋ฐ ์ดˆ๋Œ€ ๋ณด์ƒ์„ ๋ฐ›์„ ์ˆ˜ ์žˆ์Šต๋‹ˆ๋‹ค.

Sebastien Bubeck
@SebastienBubeck
I work on AI at OpenAI. Former VP AI and Distinguished Scientist at Microsoft.
๊ฐ€์ž… January 2012
1.5K ํŒ”๋กœ์ž‰ ์ค‘    93.7K ํŒฌ
3SAT in subexponential time (2^{n / log^eps(n)}) is maybe the biggest surprise I have seen during my 20 years following theoretical computer science (still remember the feeling 25 years ago seeing the diff a 3 versus a 2 can make for complexity ๐Ÿ˜…)
๋” ๋ณด๊ธฐ