sfenu

4 ms·

1. 1.▲
   by sfenu 12y ago

   That's pretty much the Havel-Hakimi algorithm
2. 2.▲
   by sfenu 12y ago

   Stop me if I'm wrong, but it seems misleading to ask whether or not the problem is in P. It seems to me that it is better to ask more generally whether the problem is tractable. There are a lot of games that are solvable in exponential
3. 3.▲
   by sfenu 13y ago

   Here's the best solution I've heard for this: The prisoners meet together and designate a leader. The leader will maintain a tally. They also designate one of the switches to not matter. The prisoners then use the following strate