가입 후 초대 링크를 공유하면 동영상 재생 및 초대 보상을 받을 수 있습니다.

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
커뮤니티로 전달