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

Lex Fridman Podcast
Lex Fridman Podcast
Lex Fridman
Hard Fork
Hard Fork
The New York Times
Darknet Diaries
Darknet Diaries
Jack Rhysider
The Gatekeepers
The Gatekeepers
BBC Radio 4
The AI Daily Brief (Formerly The AI Breakdown): Artificial Intelligence News and Analysis
The AI Daily Brief (Formerly The AI Breakdown): Artificial Intelligence News and Analysis
Nathaniel Whittemore
Lenny's Podcast: Product | Growth | Career
Lenny's Podcast: Product | Growth | Career
Lenny Rachitsky

More by UC Davis

Overcoming Public Speaking Anxiety
Overcoming Public Speaking Anxiety
Margaret Swisher and Barbara Myslik
Fundamental Algorithms in Bioinformatics
Fundamental Algorithms in Bioinformatics
Dan Gusfield
World Economic History before the Industrial Revolution, Spring 2009
World Economic History before the Industrial Revolution, Spring 2009
Gregory Clark
Developmental Psychology, Fall 2008
Developmental Psychology, Fall 2008
Victoria Cross
Molecular and Cellular Biology of Plants, Spring 2008
Molecular and Cellular Biology of Plants, Spring 2008
John Harada
General Pyschology, Winter 2009
General Pyschology, Winter 2009
Victoria Cross