Content deleted Content added
m →W[1]: clarify |
→XP: Explaining XP. Still could use examples etc. Tags: Mobile edit Mobile web edit |
||
Line 76:
=== XP ===
'''XP''' is the class of parameterized problems that can be solved in time <math>n^{f(k)}</math> for some computable function {{mvar|f}}. These problems are called [[slicewise]] polynomial, in the sense that each "slice" of fixed k has a polynomial algorithm, although possibly with a different exponent for each k. Compare this with FPT, which merely allows a different constant prefactor for each value of k. XP contains FPT, and it is believed that this containment is strict.
{{Expand section|date=April
=== A hierarchy ===
| |||