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
Computational Complexity
Description
This lecture covers the basics of computational complexity, including temporal and spatial complexity, big O notation, and complexity classes such as P and NP. It also discusses the concept of deterministic and non-deterministic Turing machines.
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.