POV-Ray : Newsgroups : povray.off-topic : NP-complete : Re: NP-complete Server Time
29 Sep 2024 13:25:31 EDT (-0400)
  Re: NP-complete  
From: Warp
Date: 9 Apr 2009 13:23:50
Message: <49de2f26@news.povray.org>
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).)

-- 
                                                          - Warp


Post a reply to this message

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