Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
Paper claims to prove P != NP
#3
Takebacker Wrote:Does it change anything if it's right?

It means every encryption can be solved in a determinable amount of time.
Reply


Messages In This Thread
Paper claims to prove P != NP - by Spaz - 2010-08-14, 06:46 PM
Paper claims to prove P != NP - by Takebacker - 2010-08-14, 06:52 PM
Paper claims to prove P != NP - by Cactuar - 2010-08-14, 06:59 PM
Paper claims to prove P != NP - by Spaz - 2010-08-14, 07:02 PM
Paper claims to prove P != NP - by Cactuar - 2010-08-14, 07:05 PM
Paper claims to prove P != NP - by Noah - 2010-08-14, 07:15 PM
Paper claims to prove P != NP - by Kortestanov - 2010-08-16, 06:28 PM

Forum Jump:


Users browsing this thread: 1 Guest(s)