{
  "id": "1803.06636",
  "version": "v1",
  "published": "2018-03-18T10:31:54.000Z",
  "updated": "2018-03-18T10:31:54.000Z",
  "title": "Complexity problems in enumerative combinatorics",
  "authors": [
    "Igor Pak"
  ],
  "comment": "30 pages; an expanded version of the ICM 2018 paper (Section 4 added, refs expanded)",
  "categories": [
    "math.CO",
    "cs.CC",
    "cs.DM",
    "math.HO",
    "math.PR"
  ],
  "abstract": "We give a broad survey of recent results in Enumerative Combinatorics and their complexity aspects.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2018-03-18T10:31:54.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "enumerative combinatorics",
      "complexity problems",
      "broad survey"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 30,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}