Skip to main content

Timeline for Subset-sum variation, multiple sums

Current License: CC BY-SA 3.0

8 events
when toggle format what by license comment
Nov 6, 2015 at 14:40 vote accept Jules
Nov 6, 2015 at 8:49 comment added Juho @Raphael Yes, possibly.
Nov 6, 2015 at 8:45 comment added Raphael @Juho Wouldn't that lead us to a Cook reduction (instead of Karp)?
Nov 6, 2015 at 8:45 history edited Raphael
edited tags
Nov 6, 2015 at 7:50 answer added Yuval Filmus timeline score: 1
Nov 6, 2015 at 7:06 comment added D.W. See cs.stackexchange.com/q/1240/755 and cs.stackexchange.com/q/11209/755 for our reference material on this topic. (Possible dup?)
Nov 6, 2015 at 6:36 comment added Juho Intuitively, suppose you had an efficient algorithm for this new problem. Using this supposed algorithm, can you solve the subset sum problem efficiently as well?
Nov 6, 2015 at 1:18 history asked Jules CC BY-SA 3.0