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:22:17 EDT (-0400)

From: Tim Cook
Date: 10 Aug 2010 06:10:23
Message: <4c61258f$1@news.povray.org>

On 2010-08-10 01:27, Warp wrote:
>    If P != NP indeed is correct, then it's certain that no algorithm can
> exist that cracks an NP encryption in polynomial time. Not now, nor any
> time in the future.

You mean 'certain that no algorithm can brute-force *all combinations* 
of an NP encryption in polynomial time.'  Merely cracking is somewhat 
more trivial, since you (usually) don't need to go through every 
possibility.

-- 
Tim Cook
http://empyrean.freesitespace.net

Post a reply to this message