{
  "id": "enwiki-001348724056",
  "slug": "expspace",
  "title": "EXPSPACE",
  "qid": "",
  "lead": "In computational complexity theory, is the set of all decision problems solvable by a deterministic Turing machine in exponential space, i.e., in O(2^{p(n)}) space, where p(n) is a polynomial function of n . Some authors restrict p(n) to be a linear function, but most authors instead call the resulting class . If we use a nondeterministic machine instead, we get the class , which is equal to by Savitch's theorem. A decision problem is if it is in , and every problem in has a polynomial-time many-one reduction to it. In other words, there is a polynomial-time algorithm that transforms instances of one to instances of the other with the same answer. problems might be thought of as the hardest problems in . is a strict superset of , , and . It contains and is believed to strictly contain it, but this is unproven.",
  "body": "In computational complexity theory, is the set of all decision problems solvable by a deterministic Turing machine in exponential space, i.e., in O(2^{p(n)}) space, where p(n) is a polynomial function of n . Some authors restrict p(n) to be a linear function, but most authors instead call the resulting class . If we use a nondeterministic machine instead, we get the class , which is equal to by Savitch's theorem. A decision problem is if it is in , and every problem in has a polynomial-time many-one reduction to it. In other words, there is a polynomial-time algorithm that transforms instances of one to instances of the other with the same answer. problems might be thought of as the hardest problems in . is a strict superset of , , and . It contains and is believed to strictly contain it, but this is unproven. \\mathsf{EXPSPACE} = \\bigcup_{k\\in\\mathbb{N}} \\mathsf{DSPACE}\\left(2^{n^k}\\right) = \\bigcup_{k\\in\\mathbb{N}} \\mathsf{NSPACE}\\left(2^{n^k}\\right) Reasoning in the first-order theory of the real numbers with +, ×, = is in EXPSPACE and was conjectured to be EXPSPACE-complete in 1986. ==See also== Game complexity",
  "categories": [
    "130042203",
    "23057298",
    "23118434",
    "23603337"
  ],
  "license": "CC BY-SA 4.0",
  "source_uri": "https://en.wikipedia.org/w/index.php?oldid=1348724056",
  "content_hash": "",
  "created_at": null,
  "updated_at": 1776121782.0,
  "claims": [],
  "contradictions": [],
  "confidence": 0.6,
  "csl": {
    "id": "enwiki-001348724056",
    "type": "webpage",
    "title": "EXPSPACE",
    "author": [
      {
        "family": "Anticloud FZ LLE",
        "literal": "Anticloud FZ LLE"
      }
    ],
    "container-title": "encyclopegia.org",
    "publisher": "Anticloud FZ LLE",
    "publisher-place": "Dubai, United Arab Emirates",
    "URL": "https://encyclopegia.org/a/expspace",
    "issued": {
      "date-parts": [
        [
          2026,
          11,
          20
        ]
      ]
    },
    "accessed": {
      "date-parts": [
        [
          2026,
          11,
          20
        ]
      ]
    },
    "license": "CC BY-SA 4.0",
    "DOI": "eo1:enwiki-001348724056",
    "isBasedOn": "https://en.wikipedia.org/w/index.php?oldid=1348724056",
    "note": "Immutable snapshot enwiki-001348724056"
  }
}