Lecture

Theory of Computation: NP Complexity

Description

This lecture explores the concept of oracles, certificates, and verification in the context of complexity theory. Oracles historically provided immediate answers, while certificates serve as concise proofs that a solution is correct. The class NP defines problems whose solutions can be efficiently verified with certificates, posing the famous P versus NP question.

Instructor

nulla minim

Quis pariatur amet est mollit exercitation fugiat. Veniam exercitation id qui laboris nisi cupidatat consequat fugiat aliquip consequat do enim deserunt non. Esse sit ea dolore eu nisi Lorem et nulla eiusmod dolor amet sint duis cupidatat. Proident eiusmod pariatur anim incididunt.

Official source

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

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 (32)

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.