Complexity & Induction: Algorithms & Proofs

In course

Commodo do amet tempor dolor exercitation dolore dolore ex proident. Veniam anim ad duis amet. Cupidatat voluptate reprehenderit laboris consectetur nisi.

Description

This lecture covers the concepts of worst-case complexity, complexity classes, tractability, and P/NP. It includes examples of algorithms like linear search, binary search, bubble sort, and insertion sort. Mathematical induction and recursion are explained with examples.

Official source

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

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

Algorithms and data structures: Analysis of algorithms, Data structures, Combinatorial optimization

Theory of computation: Computational complexity theory

Mathematics

Algebra: Abstract algebra

Number theory: Topics in number theory

Mathematical logic: Set theory

Logic

Classical logic: First-order logic

Related lectures (422)