TI - třídy složitosti, převody mezi problémy, NP-úplné problémy

About this video

Editorial review · 85% confidence

Round 7 held Teoretická informatika as possibly unofficial or school-level; round 8 read its about text and video descriptions and found it is the lecturer's/institution's own channel teaching at university level (: university course lectures for VŠB-TU Ostrava theoretical computer science subject). Title passed the strict checks; oEmbed verified.

A 155-minute video from Teoretická informatika: “TI - třídy složitosti, převody mezi problémy, NP-úplné problémy”.

Video by Teoretická informatika, played through YouTube's embedded player.