{
  "id": "1505.00118",
  "version": "v1",
  "published": "2015-05-01T08:24:10.000Z",
  "updated": "2015-05-01T08:24:10.000Z",
  "title": "Expansions of pseudofinite structures and circuit and proof complexity",
  "authors": [
    "Jan Krajicek"
  ],
  "comment": "Preliminary version May 2015",
  "categories": [
    "math.LO",
    "cs.CC"
  ],
  "abstract": "I shall describe a general model-theoretic task to construct expansions of pseudofinite structures and discuss several examples of particular relevance to computational complexity. Then I will present one specific situation where finding a suitable expansion would imply that, assuming a one-way permutation exists, the computational class NP is not closed under complementation.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2015-05-01T08:24:10.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "03F20",
      "03C99",
      "68Q15"
    ],
    "keywords": [
      "pseudofinite structures",
      "proof complexity",
      "general model-theoretic task",
      "computational class np",
      "computational complexity"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}