Conceptresearch
Kernel lower bounds
Also called kernelization lower bounds.
Methods for proving that certain problems admit no polynomial kernel unless the polynomial hierarchy collapses.
Methods for proving that certain problems admit no polynomial kernel unless the polynomial hierarchy collapses.
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 6RMKZK Edit this page History Report an error