News for hackers. Stuff that matters.
Re:Computer Scientists Make Progress on Math Puzzle by jonafato on Thursday October 28, 2010 @12:54PM (#1843680)
There seems to be a lot of disagreement about lower bounds here. The best case lower bound is trivially 0 since you could start with a terminating permutation. The article is talking about a worst case lower bound, which is what one would use to assign the problem to a complexity class.

There are no comments on this comment yet.