Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Lecture
Complexity Theory: P and NP
Description
This lecture delves into the theory of complexity classes P and NP, exploring undecidable problems and the implications of self-reference in mathematics. It discusses the hierarchy of complexity classes, practical algorithms, and examples of problems in class P. The instructor explains non-polynomial problems like the traveling salesman and the backpack problem, illustrating the challenges of finding optimal solutions. The lecture concludes with an overview of the NP class and the efficient verification of solutions.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.