2000 character limit reached
On the computational complexity of MSTD sets
Published 17 Oct 2018 in math.NT, cs.CC, and math.CO | (1810.07358v1)
Abstract: We outline a general algorithm for verifying whether a subset of the integers is a more sum than differences (MSTD) set, also known as sum dominated sets, and give estimates on its computational complexity. We conclude with some numerical results on large MSTD sets and MSTD subsets of $[1,N]\cap \mathbb Z$ for $N$ up to 160.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.