Hillel Wayne personal blog

Problems harder than NP-Complete

buttondown.email published 2023-05-116 min read

People always talk about "P vs NP" like P problems are easy and NP problems are hard. This is a useful day-to-day model but also an oversimplification....

Points

254

HN comments

98

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