POV-Ray: Newsgroups: povray.off-topic: P != NP ?: Re: P != NP ?

POV-Ray : Newsgroups : povray.off-topic : P != NP ? : Re: P != NP ?		Server Time 4 Sep 2024 03:13:39 EDT (-0400)

From: Warp
Date: 10 Aug 2010 13:50:05
Message: <4c61914d@news.povray.org>

Darren New <dne### [at] sanrrcom> wrote:
> It is. The problem is that you don't want it to be NP-hard for *everyone*.

> You only want it NP-hard for people who don't know the key.

  Well, by definition an answer to an NP problem can be verified in
polynomial time.

-- 
                                                          - Warp

Post a reply to this message