credulousperson

4 ms·

1. 1.▲
   by credulousperson 3y ago

   Opening bad-3-corrupt_lzma2.xz in an editor reveals it indeed has the string ####Hello####. I don't know enough about lzma compression streams to explain how this appears in the "compressed" version of the payload, but it doe
2. 2.▲
   by credulousperson 4y ago

   Indeed the Nash equilibrium is not always what we would like to call "optimal", especially in games with more than two players. As you notice, it is possible the Nash equilibrium strategy will be crushed if more than one agent cho
3. 3.▲
   by credulousperson 5y ago

   For those interested, Ronald Bultje (who co-devloped VP9) wrote some information here on VP9 which has some more concrete details about video coding than this article: https://blogs.gnome.org/rbultje/2016/12/1
4. 4.▲
   by credulousperson 5y ago

   A small note: If you allow randomized algorithms, this problem is actually known to be in P^PP^PP^PP which is well within PSPACE in some sense, but still a ridiculously bad bound. See https://cstheory.stackexchange.com/a&#x2
5. 5.▲
   by credulousperson 5y ago

   Unfortunately, it's impossible to do true uniform random over set of rows without doing something like count() over the things you are sampling over. You are looking to select something with probability 1/n, where n is the number