Introduction to Theoretical Computer Science - lecture 11: computational complexity of algorithms
Lecture 11 of the course Introduction to Theoretical Computer Science at Technical University of Ostrava (Czech Republic) in the school year 2019/20. Topic: ...
🔥 Related Trending Topics
LIVE TRENDSThis video may be related to current global trending topics. Click any trend to explore more videos about what's hot right now!
THIS VIDEO IS TRENDING!
This video is currently trending in Thailand under the topic 'สภาพอากาศ'.
About this video
Lecture 11 of the course Introduction to Theoretical Computer Science at Technical University of Ostrava (Czech Republic) in the school year 2019/20.
Topic: computational complexity of algorithms, asymptotic notation
Lecturer: Zdeněk Sawa
Slides: http://www.cs.vsb.cz/sawa/uti/slides/uti-11-en.pdf
Video Information
Views
47
Total views since publication
Likes
1
User likes and reactions
Duration
02:30:45
Video length
Published
May 24, 2020
Release date
Quality
hd
Video definition