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

CodeNewbie
CodeNewbie
CodeNewbie
Triple Click
Triple Click
Maximum Fun
Waveform: The MKBHD Podcast
Waveform: The MKBHD Podcast
Vox Media Podcast Network
Learn to Code With Me
Learn to Code With Me
Laurence Bradford
خرفني عن فلسطين | Tell me about Palestine
خرفني عن فلسطين | Tell me about Palestine
Tala morrar
TPP Specials
TPP Specials
TPP - The Potcast Productions

More by UC Davis

General Pyschology, Winter 2009
General Pyschology, Winter 2009
Victoria Cross
Reading and Writing: Books about Landscape Architecture, Spring 2012
Reading and Writing: Books about Landscape Architecture, Spring 2012
Heath Massey Schenker
Algorithm Design and Analysis
Algorithm Design and Analysis
Dan Gusfield
UC Davis Commencement Speakers
UC Davis Commencement Speakers
University of California, Davis
Futures and Options
Futures and Options
Collin Carter
Landscape Conservation & Sustainability: Fall 2015
Landscape Conservation & Sustainability: Fall 2015
Steve Greco