39 min

Coping with NP-completeness Algorithm Design and Analysis

    • Technology

Lecture 28: Gusfield recaps NP-completeness.
The professor discusses coping with NP-complete problems: approximation algorithms and lowering the exponent of exponential-time algorithms.

  • Copyright The Regents of the University of California, Davis campus, 2012. All Rights Reserved.

Lecture 28: Gusfield recaps NP-completeness.
The professor discusses coping with NP-complete problems: approximation algorithms and lowering the exponent of exponential-time algorithms.

39 min

  • Copyright The Regents of the University of California, Davis campus, 2012. All Rights Reserved.

Top Podcasts In Technology

All-In with Chamath, Jason, Sacks & Friedberg
All-In with Chamath, Jason, Sacks & Friedberg
All-In Podcast, LLC
No Priors: Artificial Intelligence | Technology | Startups
No Priors: Artificial Intelligence | Technology | Startups
Conviction | Pod People
Lex Fridman Podcast
Lex Fridman Podcast
Lex Fridman
Acquired
Acquired
Ben Gilbert and David Rosenthal
Hard Fork
Hard Fork
The New York Times
TED Radio Hour
TED Radio Hour
NPR

More by UC Davis

Overcoming Public Speaking Anxiety
Overcoming Public Speaking Anxiety
Margaret Swisher and Barbara Myslik
Principles of Microeconomics, Winter 2013
Principles of Microeconomics, Winter 2013
Hilary Hoynes
Vintage Lectures by UC Davis Wine Patriarch
Vintage Lectures by UC Davis Wine Patriarch
Maynard Amerine
Safety-Organized Practice for Child Welfare
Safety-Organized Practice for Child Welfare
Northern California Training Academy
Coaching in the Field of Child Welfare
Coaching in the Field of Child Welfare
Northern California Training Academy
Principles of Macroeconomics 2014
Principles of Macroeconomics 2014
Ann Stevens