This preview shows page 1. Sign up to view the full content.
Unformatted text preview: asymptotic upper bounds on their time complexity. If not, show the polynomial reduction from a NPhard problem. 4. (5+25 pts) The SetPartition Problem is deﬁned as follows. As input we are given a ﬁnite set of positive integers. The question is whether there is a subset such that the sum of the elements in equals the sum of the elements in . The RulerFolding Problem is deﬁned as follows. As input we are given a sequence of hinged ruler segments with integer lengths , and a pocket size . The question is whether the ruler can be folded (that is each hinge folded to either or degrees) to ﬁt into the pocket (See Figure below). k 5 4 3 2 1 l l l l l a. Prove that the SetPartition Problem and the RulerFolding Problem are in NP. b. Prove that the RulerFolding Problem is NPComplete assuming that the SetPartition Problem is NPComplete. 1...
View
Full
Document
This note was uploaded on 05/27/2011 for the course COT 5405 taught by Professor Ungor during the Fall '08 term at University of Florida.
 Fall '08
 UNGOR
 Algorithms

Click to edit the document details