Title: Subset Sum Problem -- from Wolfram MathWorld
Open Graph Title: Subset Sum Problem -- from Wolfram MathWorld
X Title: Subset Sum Problem -- from Wolfram MathWorld
Description: There are two problems commonly known as the subset sum problem. The first ("given sum problem") is the problem of finding what subset of a list of integers has a given sum, which is an integer relation problem where the relation coefficients a_i are 0 or 1. The ("same sum problem") is the problem of finding a set of n distinct positive real numbers with as large a collection as possible of subsets with the same sum (Proctor 1982). The same sum problem was solved by...
Open Graph Description: There are two problems commonly known as the subset sum problem. The first ("given sum problem") is the problem of finding what subset of a list of integers has a given sum, which is an integer relation problem where the relation coefficients a_i are 0 or 1. The ("same sum problem") is the problem of finding a set of n distinct positive real numbers with as large a collection as possible of subsets with the same sum (Proctor 1982). The same sum problem was solved by...
X Description: There are two problems commonly known as the subset sum problem. The first ("given sum problem") is the problem of finding what subset of a list of integers has a given sum, which is an integer relation problem where the relation coefficients a_i are 0 or 1. The ("same sum problem") is the problem of finding a set of n distinct positive real numbers with as large a collection as possible of subsets with the same sum (Proctor 1982). The same sum problem was solved by...
Opengraph URL: https://mathworld.wolfram.com/SubsetSumProblem.html
Domain: mathworld.wolfram.com
| DC.Title | Subset Sum Problem |
| DC.Creator | Weisstein, Eric W. |
| DC.Description | There are two problems commonly known as the subset sum problem. The first ("given sum problem") is the problem of finding what subset of a list of integers has a given sum, which is an integer relation problem where the relation coefficients a_i are 0 or 1. The ("same sum problem") is the problem of finding a set of n distinct positive real numbers with as large a collection as possible of subsets with the same sum (Proctor 1982). The same sum problem was solved by... |
| DC.Date.Created | 2000-02-02 |
| DC.Date.Modified | 2013-12-07 |
| DC.Subject | 11A05 |
| DC.Rights | Copyright 1999-2026 Wolfram Research, Inc. See https://mathworld.wolfram.com/about/terms.html for a full terms of use statement. |
| DC.Format | text/html |
| DC.Identifier | https://mathworld.wolfram.com/SubsetSumProblem.html |
| DC.Language | en |
| DC.Publisher | Wolfram Research, Inc. |
| DC.Relation.IsPartOf | https://mathworld.wolfram.com/ |
| DC.Type | Text |
| Last-Modified | 2013-12-07 |
| og:image | https://mathworld.wolfram.com/images/socialmedia/share/ogimage_SubsetSumProblem.png |
| og:type | website |
| twitter:card | summary_large_image |
| twitter:image:src | https://mathworld.wolfram.com/images/socialmedia/share/ogimage_SubsetSumProblem.png |
| None | ie=edge |
Links:
Viewport: width=device-width, initial-scale=1