用3SAT-证明-subset-sum-是np-complete.pdfVIP

  • 317
  • 0
  • 约1.69万字
  • 约 17页
  • 2018-10-13 发布于江苏
  • 举报
CMPSCI611: The SUBSET-SUM Problem Lecture 18 We begin today with the problem we didn’t get to at the end of last lecture – the SUBSET-SUM problem, which we also saw back in Lecture 8. The input to SUBSET- SUM is a set of numbers {a , . . . , a } and a target num- 1 n ber t, and we ask whether there is a subset of the numbers that add exactly to t. Using dynamic programming, we showed that we could decide this language in time that is polynomial in n and s, the sum of all the a .

您可能关注的文档

文档评论(0)

1亿VIP精品文档

相关文档