Algorithms for NP-Hard Problems (Section 24.5: The Final Outcome)
Why it's on BrighterTube
From a channel a BrighterTube curator approved in full · found via Round 4 discovery: listed as a featured channel by Lumen channel(s) Polylog · 85% confidenceFrom a channel Lumen includes in full: Every sampled upload is a university course lecture (Stanford CS261 and CS364A), a book-companion lecture video, or an invited technical research lecture on consensus and cryptography. All of them aim squarely at teaching algorithms, mechanism design and distributed systems. No transcript or title shows entertainment, promotion, punditry or clickbait.
What you'll learn
A 6-minute video from Tim Roughgarden Lectures's catalogue; the title names its topic.
Video by Tim Roughgarden Lectures, played through YouTube's embedded player.