P versus NP in Podcasts

concept

A fundamental problem in computational complexity theory concerning the relationship between two classes of problems.

Mentions Over Time

1 mentions

The Peterman Pod

Turing Award Winner: P vs NP, Zero-Knowledge Proofs, Quantum Computation | Avi Wigderson

In one of your lectures, you mentioned that P equals NP is philosophically about the fundamental limits of human knowledge.