Catch up on stories from the past week (and beyond) at the Slashdot story archive

 



Forgot your password?
typodupeerror
For the out-of-band Slashdot experience (mostly headlines), follow us on Twitter, or Facebook. ×

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

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

There are never any bugs you haven't found yet.

Working...