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

Dmitry Rybin
@DmitryRybin1
Cofounder $100M AI Startup in Shenzhen, Algorithm Discovery + Math (we’re hiring) | ML PhD CUHK, BSc. Math HSE | IMC🥇National Math Olympiad🥇
加入 May 2022
252 正在關注    6.1K 粉絲
Dinitz-Garg-Goemans conjecture is false. This graph theory problem was open for ~30 years. The graph below has fractional flow cost 58. Any unsplittable flow (with capacity violation <=15) has cost at least 60. Chat with GPT 5.6 Pro where this was found:
顯示更多
0
264
9.9K
930
轉發到社區