POV-Ray : Newsgroups : povray.off-topic : NP-complete : Re: NP-complete Server Time
29 Sep 2024 13:25:55 EDT (-0400)
  Re: NP-complete  
From: Nicolas Alvarez
Date: 11 Apr 2009 18:40:05
Message: <49e11c45@news.povray.org>
Warp wrote:
> triple_r <nomail@nomail> wrote:
>> http://xkcd.com/287
> 
>   Except that the problem depicted there is not NP. It's O(1).
> 
>   (It would be NP as a generic problem with unlimited input. With a fixed
> input and a fixed goal, it becomes O(1).)

Yes, but "General solutions get you a 50% tip", according to the comic
tooltip :D


Post a reply to this message

Copyright 2003-2023 Persistence of Vision Raytracer Pty. Ltd.