Definitionadvanced
W[t]-hardness
Also called W[1]-hard, W[t]-complete.
Hard for a W[t] class under parameterized reductions, which makes FPT unlikely.
Hard for a W[t] class under parameterized reductions, which makes FPT unlikely.
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 HYGDGP Edit this page History Report an error