50 min

Major theorems of NP-completeness Algorithm Design and Analysis

    • Technology

Lecture 27 covers the major theorems of NP-completeness, P = NP question, and how to prove a new problem in NP-complete.

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

Lecture 27 covers the major theorems of NP-completeness, P = NP question, and how to prove a new problem in NP-complete.

50 min

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

Top Podcasts In Technology

Acquired
Acquired
Ben Gilbert and David Rosenthal
Lex Fridman Podcast
Lex Fridman Podcast
Lex Fridman
Waveform: The MKBHD Podcast
Waveform: The MKBHD Podcast
Vox Media Podcast Network
All-In with Chamath, Jason, Sacks & Friedberg
All-In with Chamath, Jason, Sacks & Friedberg
All-In Podcast, LLC
Lenny's Podcast: Product | Growth | Career
Lenny's Podcast: Product | Growth | Career
Lenny Rachitsky
Darknet Diaries
Darknet Diaries
Jack Rhysider

More by UC Davis

PSC100 - Introduction to Cognitive Psychology
PSC100 - Introduction to Cognitive Psychology
Victoria Cross
Futures and Options
Futures and Options
Collin Carter
UC Davis Particle Physics Seminars
UC Davis Particle Physics Seminars
John Terning
Principles of Microeconomics, Winter 2013
Principles of Microeconomics, Winter 2013
Hilary Hoynes
Principles of Macroeconomics 2014
Principles of Macroeconomics 2014
Ann Stevens
Overcoming Public Speaking Anxiety
Overcoming Public Speaking Anxiety
Margaret Swisher and Barbara Myslik