Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with subset-sum
Search options answers only
not deleted
user 1984
Questions about the NP-complete problem Subset Sum.
1
vote
Accepted
Can the subset sum problem work with an undefined set?
If you only have extra impurities, then the DECOMP program described in the following paper will efficiently solve the problem -- even if you only have an approximate mass difference $d$ to work with: …
- 5,509
1
vote
Unlimited use subset sum
If the $k_i$ are restricted to be positive integers (please clarify whether this is the case or not in your question), D.W.'s nice approach could give an invalid answer (i.e., an answer with some $k_i …
- 5,509
3
votes
Subset Sum With Interval Target
With negative integers permitted
Unlike the SSITP problem restricted to positive integers, when negative integers are permitted the problem is NP-complete. I'll show this by reduction from ordinary Su …
- 5,509
4
votes
Accepted
Subset Sum With Interval Target
With positive integers only
Consider the largest element $a_m$ in the input. We have the following cases:
$a_m \in [\lceil\frac{1}{2}T\rceil, \lfloor\frac{3}{4}T\rfloor]$. We can simply choose $\{a_m …
- 5,509