{
  "id": "strong-exponential-time-hypothesis",
  "title": "Strong Exponential Time Hypothesis",
  "lang": "en",
  "source_lang": "en",
  "summary": "The Strong Exponential Time Hypothesis asserts that the exponential-time complexity of Boolean satisfiability approaches exhaustive search as clause width increases.",
  "category": "computer-science",
  "subcategory": "algorithms-theory",
  "type": "concept",
  "aliases": [
    "SETH"
  ],
  "generated_at": "2026-11-05",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/strong-exponential-time-hypothesis/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/strong-exponential-time-hypothesis/",
      "json": "https://aiwiki.page/zh/strong-exponential-time-hypothesis.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "The Strong Exponential Time Hypothesis (SETH) is a conjecture in computational complexity about the time required to solve the Boolean satisfiability problem. It states that, for every constant \\(\\varepsilon>0\\), there is a fixed clause width \\(k\\) for which \\(k\\)-SAT cannot be solved by a deterministic algorithm in time \\(O(2^{(1-\\varepsilon)n})\\), apart from factors polynomial in the input size, where \\(n\\) is the number of Boolean variables. Informally, algorithms for increasingly wide clauses cannot maintain a fixed improvement over the exponent of exhaustive search. SETH is unproved and serves as a foundation for many conditional running-time lower bounds."
    },
    {
      "heading": "Formal statement",
      "text": "A Boolean formula in conjunctive normal form is an AND of clauses, each of which is an OR of literals. A literal is a variable or its negation. In \\(k\\)-SAT, each clause contains at most \\(k\\) literals, and the task is to determine whether some assignment of truth values satisfies every clause.\n\nTrying all \\(2^n\\) assignments gives a running time of \\(O(2^n\\operatorname{poly}(L))\\), where \\(L\\) is the input length. The notation \\(O^*(\\cdot)\\) suppresses polynomial factors in that length.\n\nOne formulation defines\n\n\\[s_k=\\inf\\left\\{c\\geq 0: k\\text{-SAT has a deterministic algorithm running in } O^*(2^{cn})\\right\\}.\\]\n\nSince allowing wider clauses includes all instances with narrower clauses, \\(s_k\\) is nondecreasing in \\(k\\), and exhaustive search gives \\(s_k\\leq 1\\). SETH asserts\n\n\\[\\lim_{k\\to\\infty}s_k=1.\\]\n\nEquivalently, for every \\(\\varepsilon\\in(0,1)\\), some fixed \\(k\\) admits no deterministic \\(O^*(2^{(1-\\varepsilon)n})\\)-time algorithm.\n\nWhy the quantifier order matters\n\nSETH does not assert that every fixed-width satisfiability problem requires \\(2^{n-o(n)}\\) time. For each fixed \\(k\\), algorithms can achieve an exponential base strictly below \\(2\\). SETH allows those improvements, provided their advantage can vanish as \\(k\\) increases.\n\nFor example, a hypothetical family of algorithms with running times\n\n\\[O^*(2^{(1-1/k)n})\\]\n\nwould be consistent with SETH: the improvement in the exponent approaches zero.\n\nBy contrast, algorithms running in \\(O^*(2^{0.99n})\\) for every fixed \\(k\\) would refute SETH. The algorithms could differ with \\(k\\); what matters is that the improvement \\(0.01\\) would be independent of clause width.\n\nThe parameter \\(n\\) is the number of variables, not the number of clauses or the total encoding length. This distinction is important when interpreting reductions and lower bounds."
    },
    {
      "heading": "Origins and relation to ETH",
      "text": "SETH emerged from work by Russell Impagliazzo and Ramamohan Paturi on the exponential-time complexity of satisfiability, notably their 2001 paper On the Complexity of k-SAT. It strengthens the Exponential Time Hypothesis (ETH).\n\nIn the notation above, ETH asserts that\n\n\\[s_3>0.\\]\n\nThus, ETH postulates a positive exponential rate for solving 3-SAT, whereas SETH asserts that the rates for \\(k\\)-SAT approach \\(1\\) as clause width grows.\n\nThe distinction is substantial. ETH could remain true even if every fixed-width satisfiability problem were solvable in \\(O^*(2^{0.1n})\\) time. Such a uniform improvement would contradict SETH.\n\nSETH implies ETH. A key ingredient connecting the two is the sparsification lemma, which decomposes a fixed-width formula into a controlled number of sparse formulas. It enables reductions to preserve sufficiently precise exponential running-time bounds.\n\nBoth hypotheses imply that P differs from NP, but neither follows merely from that separation. The assertion that no polynomial-time algorithm exists says much less than a conjecture specifying an exponential rate. Likewise, NP-completeness alone does not establish a SETH-style running-time lower bound."
    },
    {
      "heading": "Role in fine-grained complexity",
      "text": "SETH is a central assumption in fine-grained complexity, which studies the precise running times of computational problems, including problems already known to be solvable in polynomial time.\n\nA conventional polynomial-time reduction may establish that a problem is NP-hard, but it usually does not preserve running times precisely enough to distinguish, for example, quadratic from strongly subquadratic algorithms. A fine-grained reduction instead tracks how an improvement in one problem would produce a forbidden improvement in another.\n\nA typical SETH-based result has the form:\n\nIf problem \\(A\\) has an \\(O(N^{2-\\delta})\\)-time algorithm for some fixed \\(\\delta>0\\), then SETH is false.\n\nSuch a statement conditionally rules out strongly subquadratic algorithms. It does not necessarily exclude running times such as\n\n\\[\\frac{N^2}{\\log N} \\quad\\text{or}\\quad N^2\\exp(-\\sqrt{\\log N}),\\]\n\nbecause neither has the form \\(O(N^{2-\\delta})\\) for a fixed positive \\(\\delta\\).\n\nThe conclusion is conditional rather than an unconditional lower bound: either the proposed fast algorithm does not exist, or SETH fails."
    },
    {
      "heading": "A representative reduction: orthogonal vectors",
      "text": "The orthogonal vectors problem illustrates how satisfiability hardness can translate into a quadratic-time barrier.\n\nIn its bichromatic Boolean form, the input consists of two sets \\(A,B\\subseteq\\{0,1\\}^d\\), each containing \\(N\\) vectors. The question is whether there are vectors \\(a\\in A\\) and \\(b\\in B\\) with\n\n\\[a\\cdot b=\\sum_{j=1}^{d}a_jb_j=0.\\]\n\nBecause the coordinates are nonnegative, orthogonality means that no coordinate contains a \\(1\\) in both vectors.\n\nA basic reduction from satisfiability proceeds as follows:\n\n- Divide the formula’s \\(n\\) variables into two approximately equal groups.\n- Enumerate all assignments to each group.\n- Give each partial assignment a vector with one coordinate per clause.\n- Set a coordinate to \\(1\\) exactly when that partial assignment satisfies no literal in the corresponding clause.\n\nTwo partial assignments combine into a satisfying assignment precisely when their vectors are orthogonal. Every clause must be satisfied by at least one half.\n\nEach vector set has size approximately\n\n\\[N=2^{n/2}.\\]\n\nFor fixed \\(k\\), the formula can be normalized to have only polynomially many distinct clauses, so \\(d=n^{O(1)}\\). An algorithm with running time\n\n\\[O(N^{2-\\delta}\\operatorname{poly}(d)), \\qquad 0<\\delta<1,\\]\n\nwould therefore yield a satisfiability algorithm running in\n\n\\[O^*(2^{(1-\\delta/2)n}).\\]\n\nIf this improvement applied uniformly to every fixed clause width, it would contradict SETH.\n\nUsing sparsification, standard formulations obtain conditional quadratic barriers even for dimensions proportional to \\(\\log N\\), with the proportionality constant depending on the desired exponent improvement. The dimension restriction is essential: low-dimensional special cases can have faster algorithms without contradicting SETH."
    },
    {
      "heading": "Applications to sequence problems",
      "text": "SETH-based reductions support lower bounds for several classical sequence problems.\n\nFor edit distance, standard dynamic programming computes the distance between two length-\\(N\\) strings in quadratic time. SETH implies that exact edit distance, even over suitable fixed finite alphabets, has no \\(O(N^{2-\\delta})\\)-time algorithm for any constant \\(\\delta>0\\).\n\nComparable strongly subquadratic barriers are known for longest common subsequence under standard formulations. These results are notable because the problems are polynomial-time solvable: the conjectured difficulty concerns improving the polynomial exponent, not deciding whether polynomial-time algorithms exist.\n\nSuch lower bounds depend on the exact problem definition. Exact computation, approximation, restricted alphabets, bounded distance, and compressed inputs are different settings. A lower bound for one does not automatically apply to the others."
    },
    {
      "heading": "Variants and scope",
      "text": "Deterministic and randomized algorithms\n\nThe usual deterministic formulation of SETH excludes deterministic satisfiability algorithms with the specified running times. The randomized Strong Exponential Time Hypothesis, often called randomized SETH, makes the corresponding assertion for bounded-error randomized algorithms.\n\nThis distinction matters when a proposed target algorithm is randomized: combining it with a deterministic reduction generally produces a randomized satisfiability algorithm. A lower-bound claim must therefore specify the appropriate assumption.\n\nDecision and counting\n\nSETH concerns deciding whether a satisfying assignment exists. Counting satisfying assignments is a different problem, and counting versions of exponential-time hypotheses are separate assumptions. A decision-based lower bound should not be silently replaced by a counting-based one.\n\nClassical and quantum computation\n\nSETH is normally an assumption about classical computation. A quantum computer can use Grover’s algorithm to search the assignment space in roughly \\(2^{n/2}\\) oracle queries, with polynomial overhead for evaluating a formula. This does not refute classical SETH. Quantum lower-bound research requires assumptions formulated for quantum algorithms."
    },
    {
      "heading": "Limitations and interpretation",
      "text": "SETH is a worst-case hypothesis. It does not imply that typical satisfiability instances, application-specific instances, or experimentally generated instances require exhaustive-search-like running times. Practical solvers can exploit structure and heuristics that are not reflected in worst-case bounds.\n\nNor does SETH exclude every useful improvement. Faster polynomial factors, smaller memory requirements, special-case algorithms, and approximation algorithms may remain possible. The precise restriction depends on the reduction and on whether it preserves input size, parameters, randomness, and the required output.\n\nFinally, SETH is stronger than what many individual lower-bound arguments need. A theorem proved assuming SETH may also follow from a weaker, problem-specific conjecture. Conversely, refuting SETH would invalidate SETH as a justification for its consequences, but would not automatically supply fast algorithms for every problem whose known lower bound relies on it: a reduction transfers an algorithmic improvement only in its established direction."
    }
  ],
  "links": [
    "computational-complexity",
    "boolean-satisfiability-problem",
    "algorithm",
    "conjunctive-normal-form",
    "exponential-time-hypothesis",
    "p-versus-np-problem",
    "np-completeness",
    "np-hardness",
    "edit-distance",
    "dynamic-programming",
    "randomized-algorithm",
    "quantum-computer",
    "grovers-algorithm",
    "heuristic"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}