Complexity and NP Problems
Richard discusses the intricacies of algorithm complexity, emphasizing the distinction between problems that are easy to solve and those that are easy to verify. He highlights the challenges of finding cliques in graphs, illustrating how verification can be straightforward, while the search for solutions remains complex. The conversation delves into the broader implications of NP problems, suggesting that the realm of verifiable problems may extend far beyond those that can be efficiently solved.In this clip
From this podcast
Lex Fridman Podcast
Richard Karp: Algorithms and Computational Complexity | Lex Fridman Podcast #111
Related Questions