Hillel Wayne personal blog

NP-complete isn't always hard

hillelwayne.com published 2023-02-205 min read

A common assumption I see on the ‘net is that NP-complete problems are impossible to solve. I recently read that dependency management in Python is hard because package resolution is NP-complete. This is true in principle, but the reality is more complicated. When we say “NP-complete is hard” we’re talking about…

Points

115

HN comments

73

Submissions

1

Cited by

0 commenters

Math & AlgorithmsSoftware Engineering2023

Related posts from the same era

Bicycle

Bartosz Ciechanowski20233,014 points399 commentscited by 14 details

Airfoil

Bartosz Ciechanowski20242,544 points356 commentscited by 8 details

Learning to Reason with LLMs

OpenAI Blog20241,654 points1,261 commentscited by 18 details

4B If Statements

AAndreas Karlsson20231,518 points645 comments details

AI solves International Math Olympiad problems at silver medal level

Google DeepMind20241,370 points525 commentscited by 16 details

Heuristics that almost always work

Scott Alexander20221,000 points520 commentscited by 14 details