this post was submitted on 10 Aug 2023
256 points (92.1% liked)

Comic Strips

12519 readers
3314 users here now

Comic Strips is a community for those who love comic stories.

The rules are simple:

Web of links

founded 1 year ago
MODERATORS
 
you are viewing a single comment's thread
view the rest of the comments
[–] CoderKat@lemm.ee 1 points 1 year ago

In general, P = NP means that some algorithms will become much faster to solve. We have some algorithms that we depend on being hard. Most notable is encryption. We depend on it being hard for am attacker to crack the encryption (but easy for someone who already knows the answer -- eg, your password). P = NP might (but not necessarily) make it easy enough for encryption to therefore be broken.

I say not necessarily because while P = NP does mean certain types of algorithms will become faster (in at least certain cases), it's still possible for them to be quite slow. P and NP refer to how long algorithms take, based on how they scale with input. P is polynomial and NP is non-polynomial. Polynomial functions scale far better than non-polynomial functions, but that doesn't mean they necessarily scale well, as there's plenty of types of polynomial functions, some which scale far, far better than others.