not graded Problem 1. (problem 7.15) Let UNARY-SSUM be the subset-sum problem in which all numbers are represented in unary. That is, each number k is encoded as a string of k " 1 " s. (a) Show that UNARY-SSUM is in P. (b) Why does the NP-completeness proof for SUBSET-SUM in the book fail to show UNARY-SSUM is NP-complete? Be specific as you can about what… (More)

@inproceedings{Cs215RE,
title={Cs215 Review Exercises},
author={}
}