Mod-06 Lec-13 Lower Bounds
Why it's on BrighterTube
Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidenceLower Bounds examines theoretical limits on algorithm complexity for geometric problems. This 56-minute lecture proves fundamental bounds on sorting and searching in geometric contexts.
What you'll learn
A 56-minute video from nptelhrd: “Mod-06 Lec-13 Lower Bounds”.
Video by nptelhrd, played through YouTube's embedded player.