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]∩Z for N up to 160.
@article{arxiv.1810.07358,
title = {On the computational complexity of MSTD sets},
author = {Tanuj Mathur and Tian An Wong},
journal= {arXiv preprint arXiv:1810.07358},
year = {2018}
}