definition

Polynomial time versus NP as the central question of complexity

Moitra explains P versus NP: problems whose solutions can be verified in polynomial time are NP, and the question is whether they can always be solved in polynomial time; the presumption is no, and most of modern cryptography relies on that presumption.

definitionpending

Speaker

Ankur Moitra

Evidence Quote

“the presumption in our field is that no, it's not easy, and that's the basis you know, of a lot of things like cryptography”

Source

Lex Fridman Podcast #503 - AI Crisis in Math— Lex Fridman Podcast
Created: 11/17/2026, 6:25:32 AM

Your notes

Loading notes...