[PRL] Re: [plt-internal] cisco router problem

[Matthias Felleisen]

Based on what I see, it may be possible to run O(n2) in a reasonable
time. I'll report back. -- Matthias


On Wednesday, January 14, 2004, at 03:05 PM, Robby Findler wrote:

> At Wed, 14 Jan 2004 15:00:12 -0500, Matthias Felleisen wrote:
>> P.S. I know one of you thought that this would be the case, but I
>> forgot who. One winner.
>
> I think we all thought it was (roughly) the same problem: turning an
> O(n) problem into O(n^2) by being naive. In this case, however, he also
> tacked on a huge constant :)
>
> Robby