Lecture

Understanding Complexity: Algorithms and NP Problems

In course

In Lorem eu reprehenderit tempor consequat id. Consectetur quis ea adipisicing aute commodo veniam dolore ea ad nostrud elit est sint. Cillum cupidatat consectetur aute sit id in ullamco sint aliqua nulla incididunt dolor irure irure. Amet sit sit quis cillum commodo ea anim et dolor velit. Eu velit mollit aute incididunt sint esse fugiat laboris adipisicing.

Description

This lecture covers complexity classes, the effect of complexity on computer time, tractable problems, the class NP, NP-complete problems, 3-SAT, and summarizes the concept of tractable problems belonging to Class P.

Official source

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

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

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.