alexirpan

3 ms·

1. 1.▲
   by alexirpan 3y ago

   It's not a typo - specifically the time complexity is O(n^2 2^n 2^n) = O(n^24^n). This is faster than your O(N! N!) proposal. https://www.wolframalpha.com/input?i=plot+%28n%21%29%5E2+vs+... To be more specific - you ge
2. 2.▲
   by alexirpan 3y ago

   You can actually do better than O((N!)^2), you can get it in O(n^24^n) because you can reduce the state to finding the next best single player to send in given the unordered set of unused players. Source: the part of the post literally a fe
3. 3.▲
   by alexirpan 9y ago

   Author here. My intent was to say, "When someone I know asks me if RL is a good idea, the answer is no >= 70% of the time." The important missing piece is that it's conditioned on that person asking me in particular. I don
4. 4.▲
   A Gentle Introduction to Secure Computation(alexirpan.com)

   59 points by alexirpan 11y ago|6 comments
5. 5.▲
   Thoughts on Grad School as a Graduating Undergrad(alexirpan.com)

   2 points by alexirpan 11y ago|0 comments
6. 6.▲
   “How Do You Feel About Grad School?”(alexirpan.com)

   1 points by alexirpan 11y ago|0 comments