The subset-sum problem is one of the most frequently occurring NP (nondeterministic, polynomial-time)-complete) problems. It asks whether a subset of numbers in a set of positive integers adds up ...
Cameron and Erdős raised the question of how many maximal sum-free sets there are in {1,..., n}, giving a lower bound of 2⌊n/4⌋. In this paper we prove that there are in fact at most 2(1/4+o(1))n ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback