Content deleted Content added
Changed inline citation to footnote |
m Edited sentence to indicate that problems with EPTAS's are also FPT. |
||
Line 31:
FPT is closed under a parameterised [[Reduction (complexity)|reduction]] called '''''fpt-reduction''''', which simultaneously preserves the instance size and the parameter.
Obviously, FPT contains all polynomial-time computable problems. Moreover, it contains all optimisation problems in NP that allow
=== ''W'' hierarchy ===
| |||