Date: 2016-03-15 10:47:56NP-complete problems Computational complexity theory Analysis of algorithms Operations research NP-hard problems Vertex cover Travelling salesman problem Dynamic programming Parameterized complexity Independent set Algorithm 2-satisfiability | | CS261: A Second Course in Algorithms Lecture #19: Beating Brute-Force Search∗ Tim Roughgarden† March 8, 2016 A popular myth is that, for N P -hard problems, there are no algorithms with worst-case running time betterAdd to Reading ListSource URL: theory.stanford.eduDownload Document from Source Website File Size: 240,24 KBShare Document on Facebook
|