{
  "id": "1810.07358",
  "version": "v1",
  "published": "2018-10-17T02:30:45.000Z",
  "updated": "2018-10-17T02:30:45.000Z",
  "title": "On the computational complexity of MSTD sets",
  "authors": [
    "Tanuj Mathur",
    "Tian An Wong"
  ],
  "categories": [
    "math.NT",
    "cs.CC",
    "math.CO"
  ],
  "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2018-10-17T02:30:45.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "11P99",
      "11Y16",
      "11P70"
    ],
    "keywords": [
      "computational complexity",
      "large mstd sets",
      "general algorithm",
      "sum dominated sets",
      "mstd subsets"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}