Lecture

Understanding Complexity: Tractable Problems and NP-Complete

In course

Do veniam aute pariatur laboris pariatur eu quis magna consequat ad. Ex laboris irure amet sint aliquip fugiat duis. Nostrud est eiusmod magna consectetur eu officia adipisicing occaecat nostrud ea. Incididunt quis culpa officia tempor eu nisi do qui voluptate dolor eu tempor dolore. Officia commodo adipisicing irure reprehenderit dolore laborum dolor irure adipisicing eu.

Description

This lecture covers complexity classes, including constant, logarithmic, linear, linearithmic, polynomial, exponential, and factorial complexities. It explains the effect of complexity on computer time and introduces tractable problems, the class NP, NP-complete problems, and 3-SAT.

Official source

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

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.