Conceptadvanced
Strong Exponential Time Hypothesis
Also called SETH.
Conjecture that for every epsilon > 0 there is k such that k-SAT cannot be solved in time 2^((1-epsilon)n).
Conjecture that for every epsilon > 0 there is k such that k-SAT cannot be solved in time 2^((1-epsilon)n).
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag W0X5VV Edit this page History Report an error