Efficient Algorithm for finding a large sum-free subset.

123 Views Asked by At

Erdos's famous result shows that given n nonzero integers, there is a sum-free subset of size> n/3. The traditional proof gives only a pseudopolynomial time algorithm. Alon-Spencer claims that there is a deterministic efficient algorithm using a prime p that is relatively prime to all the given integers. Can one show how?

1

There are 1 best solutions below

0
On

I found the answer.

The algorithm has been shown to be polynomial: https://doi.org/10.1016/0020-0190(94)90063-9

Also in Jukna's combinatorics book: http://lovelace.thi.informatik.uni-frankfurt.de/~jukna/EC_Book/sample/316-317.pdf