Coping with NP-completeness Algorithm Design and Analysis
-
- Technologie
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 Technologie
Mehr von UC Davis
Literature and the Environment, Fall 2008
Timothy Morton
UC Davis Commencement Speakers
University of California, Davis
Futures and Options
Collin Carter
Landscape Conservation & Sustainability: Fall 2015
Steve Greco
2013 Conference on the Affordable Care Act and Low Income Populations
UC Davis Center for Poverty Research
Technology and Future Landscapes, Spring 2015
Claire Napawan