Re: Aspiring highest-order programmer

From: Tomasz Zielonka (t.zielonka_at_zodiac.mimuw.edu.pl)
Date: 06/12/04 

Date: Sat, 12 Jun 2004 13:44:00 +0000 (UTC)

Ian Woods wrote:
>
> For NP, it means that there is no known polynomial time algorithm to
> solve the problem.

Last time I checked NP was a superset of P.

Best regards,
Tom 

-- 
.signature: Too many levels of symbolic links