Construct · 1 fields · 1 citations

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 3-SAT cannot be solved in time subexponential in the number of variables, used to derive fine-grained lower bounds.

In computational complexity, exponential time hypothesis refers to the conjecture that 3-SAT cannot be solved in time subexponential in the number of variables, used to derive fine-grained lower bounds. This meaning comes from Impagliazzo (2001) in Journal of Computer and System Sciences.[1]

Unit
Recovery means
Measured by

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

See how 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

complexity4 fields · 7 citationsjingle · one word, four constructs hypothesis2 fields · 2 citationsjingle · one word, two constructs number3 fields · 6 citationsjingle · one word, three constructs

References

Impagliazzo, R., & Paturi, R. (2001). On the Complexity of k-SAT. Journal of Computer and System Sciences, 62(2), 367-375. https://doi.org/10.1006/jcss.2000.1727

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