← Jargon

Jargonmathematics· 9 claims· 6 episodes

P versus NP

A foundational question in computer science about whether problems whose solutions can be quickly verified can also be quickly solved; many logistics optimizations fall into the hard (NP) category.

As defined in 171 | Christopher Mims on Our Interconnected Industrial Ecology


Where it comes up · 6

Most important claims · 9 of 9Search all claims for “P versus NP” →