Understanding Asymptotic Worst-Case Complexity in Discrete Math
A straightforward overview of what asymptotic worst-case complexity means in discrete mathematics, focusing on its fundamental concepts without heavy formalism.
Elisa Schaeffer (satuelisa)
94 views • Oct 14, 2021
About this video
A first glance, with as little formality as possible, to what all of this means.
Video Information
Views
94
Likes
1
Duration
01:02:23
Published
Oct 14, 2021