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
Elements of Computational Complexity
Description
This lecture covers the fundamentals of computational complexity, including tractable and intractable problems, decision problems, complexity classes, quantum computational complexity, and NP-hard and NP-complete problems. It also delves into the concept of Merlin-Arthur protocols and probabilistic algorithms.
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.