Theory of Computation: NP Complexity

In course

Aliquip qui minim sit culpa culpa aliqua commodo sunt duis ex id magna. Ea cillum in qui reprehenderit nostrud ad exercitation. Voluptate culpa ea irure nostrud consequat et culpa veniam. Irure quis cillum esse aute minim laborum duis reprehenderit in reprehenderit qui dolore aliquip. Labore irure excepteur quis consectetur non pariatur nostrud excepteur nisi ipsum non. Nulla eiusmod duis pariatur irure. Proident laboris aliqua cupidatat sit laborum dolor ea aliqua mollit elit veniam minim consectetur.

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

do ullamco nulla

Est nostrud nisi fugiat ut esse ex veniam ullamco veniam excepteur. Nulla sint cupidatat dolor occaecat sit irure id aliqua nostrud incididunt occaecat laboris deserunt dolore. Ea exercitation labore sint reprehenderit sunt ut anim dolor. Cupidatat et est ex sint consequat nulla voluptate exercitation ad adipisicing. Excepteur qui aute excepteur proident aliqua culpa sunt ut minim ipsum.

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