Cs 6515 algos test 3 - Study guides, Class notes & Summaries

CS 6515 Algos Test 3 with complete solution

Search Problem - ANSWER-A search problem is specified by an algorithm C that takes two inputs, an instance I and a proposed solution S, and runs in time polynomial in |I|. We say S is a solution to I if and only if C(I, S) = true Steps for an NP Proof - ANSWER-1. Demonstrate that problem B is in the class of NP problems 2. Demonstrate that problem B is at least as hard as a problem believed to be NP-Complete*. This is done via reduction from a known problem A (A→B) 2a. Show how an inst...