STAT 2507 Final: Problem_12
23 Oct 2020
School
Department
Course
Professor
Document Summary
Describe the error in the following fallacious proof that p np. Assume that p = np and obtain a contradiction. Because every language in np is polynomial time reducible to sat, you have. Consider the following deceptive proof that: suppose that and obtain a contradiction, if has given, then for some and, as every language in is polynomial time reducible to. ,then: due to the assumption which is taken above, then. The above steps are used to proof of free, the time needed for calculating the reduction must be taken in to account. Now, consider the step 3, here the time needed for calculating the reduction is not taken into account.
