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.
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
Top Podcasts In Technology
More by UC Davis
PSC100 - Introduction to Cognitive Psychology
Victoria Cross
Futures and Options
Collin Carter
UC Davis Particle Physics Seminars
John Terning
Principles of Microeconomics, Winter 2013
Hilary Hoynes
Principles of Macroeconomics 2014
Ann Stevens
Literature and the Environment, Fall 2008
Timothy Morton