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.

Instructor

Dolore est reprehenderit laboris voluptate nulla mollit officia. Consectetur ex ad in sit officia enim adipisicing. Fugiat ullamco anim deserunt et nostrud tempor. Nostrud consequat quis adipisicing adipisicing tempor irure. Laboris eiusmod pariatur Lorem anim ut aute ipsum id proident do velit.

Official source

https://mediaspace.epfl.ch/media/0_e04i83hc

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.

Ontological neighbourhood

Theoretical computer science

Theory of computation: Computational complexity theory

Related lectures (80)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.