abheekd/website
1
0
Fork 0
forked from a/website
Code Issues Pull requests Packages Projects Releases Wiki Activity

Add comment about P vs. NP

Browse source
This commit is contained in:
Anthony Wang 2022-01-31 11:28:27 -06:00
parent e135ca81f9
commit 968fbe47fd
Signed by untrusted user: a
GPG key ID: BC96B00AEC5F2D76
1 changed files with 1 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
content/posts/installing-every-arch-package.md
View file

@ -42,7 +42,7 @@ For each edge, we need to pick at most one package, but not both. That sounds a
Wait... it's NP hard though? And we have up to 12000 nodes, so we'll never be able to find the answer before the heat death of the universe, right?
Well, do we have 12000 *connected* nodes? No, since the largest connected component is probably only a few nodes. We aren't going to have hundreds or thousands of packages all conflicting with each other.
Well, do we have 12000 *connected* nodes? No, since the largest connected component is probably only a few nodes. We aren't going to have hundreds or thousands of packages all conflicting with each other. Therefore, we don't need to solve [P vs. NP](https://en.wikipedia.org/wiki/P_versus_NP_problem) to be able to find the maximum independent set of this particular graph. Phew!
## Implementing this in Julia