Slashdot is powered by your submissions, so send in your scoop

 



Forgot your password?
typodupeerror

Comment: Re:This will NO break any encryption algorithms... (Score 1) 318

by pyrros (#35343972) Attached to: No P = NP Proof After All

Your definition is the definition of NP, not NP complete. NP-complete is the set of all problems that are in NP and NP hard (i.e. all problems in NP can be reduced in polynomial time to a problem in NP-complete). If P=NP, all problems in NP can be reduced in polynomial time to any other problem in NP (because they can be solved in polynomial time)

FTFY

The other line moves faster.

Working...