Mallesh Pai
@malleshpai
Forward Deployed Researcher and Recovering Economist @tempo.
가입 December 2009
1K 팔로잉 중 5.9K 팬
Whenever anyone talks about complexity theory or improving the asymptotic rate, I always think back to my favorite result in machine learning (cc @dankrad )
People love to tell you about how actually P=NP won't necessarily break cryptography because algorithms in P can still have insane constants/exponents
