Conceptresearch
Set cover conjecture
Also called set cover hypothesis.
Conjecture that set cover on n elements and m sets needs 2^(n) time up to subexponential factors in the sparse regime.
Conjecture that set cover on n elements and m sets needs 2^(n) time up to subexponential factors in the sparse regime.
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 76M15A Edit this page History Report an error