Construct · 1 fields · 1 citations

strong exponential time hypothesis: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Computational complexity

the conjecture that satisfiability of k-CNF formulas needs time close to 2^n as k grows, a base assumption for fine-grained lower bounds.

In computational complexity, strong exponential time hypothesis refers to the conjecture that satisfiability of k-CNF formulas needs time close to 2^n as k grows, a base assumption for fine-grained lower bounds. This meaning comes from Calabro (2009) in Lecture Notes in Computer Science.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how strong exponential time hypothesis sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

base3 fields · 4 citationsjingle · one word, three constructs complexity4 fields · 7 citationsjingle · one word, four constructs exponential time hypothesis1 fields · 1 citationsanchor · a standalone construct

References

Calabro, C., Impagliazzo, R., & Paturi, R. (2009). The Complexity of Satisfiability of Small Depth Circuits. In Lecture Notes in Computer Science (pp. 75-85). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-11269-0_6

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct