Google, IBM & Meta Certificates – 40% Off
One plan covers every Professional Certificate on Coursera.
Unlock All Certificates
Learn about different classes of search problems in this advanced seminar lecture from the Kolmogorov Seminar series on computational and descriptional complexity. Explore how existential results naturally lead to search problems, using examples like finding multicolored triangles in colored triangulations through Sperner's lemma. Examine the fascinating hierarchy of corresponding complexity classes while diving deep into theoretical computer science concepts originally developed from Kolmogorov's foundational work in 1979.
