Search results

[[{{{1|}}}#fpt|FPT]] - [[{{{1|}}}#fptnu|FPT_nu]] -

Without the nondeterminism, this would also be contained in [[F#fpt|FPT]], as the runtime is fixed-parameter tractable. But, it is nondeterministic Strictly contains [[Complexity Zoo:F#fpt|FPT]] (by diagonalization).

Contains [[Complexity Zoo:F#fpt|FPT]]. <li>If [[Complexity Zoo:F#fpt|FPT]] = W[1] then [[Complexity Zoo:N#np|NP]] is contained in [[Complexity Zoo:D

Defined in [[zooref#kw15|[KW15]]]. Contains [[#fert|FERT]] and [[#fpt|FPT]] and is contained in para-[[Complexity Zoo:N#np|NP]]<sup>[[Complexity Zoo: Contained in [[#fpt|FPT]]

<li>If [[Complexity Zoo:F#fpt|FPT]] = [[Complexity Zoo:X#xpuniform|XP_uniform]] then EPTAS = [[Comp <li>If EPTAS = [[Complexity Zoo:P#ptas|PTAS]] then [[Complexity Zoo:F#fpt|FPT]] = [[Complexity Zoo:W#wp|W[P]]].</li>

...[P] (i.e. with no restriction on depth) is equal to [[Complexity Zoo:F#fpt|FPT]].

...ns}. I assume the ETH (that 3SAT can't be solved in 2^o(n)), which has the FPT corollary Clique can't be solved in f(k)n^o(k). If there a simple ...C || NP-Complete ''[2]'' <br /> G^H+2 <br /> 2^o(G) || FPT<br />H^HG<br />2^o(H)G ''[3]''

...ion problems are fixed-parameter tractable (i.e. in [[Complexity Zoo:F#fpt|FPT]]).

See also [[Complexity Zoo:F#fpt|FPT]].

Same as [[Complexity Zoo:F#fpt|FPT]], except that now on input (x,k) (k a parameter), the <i>space</i> used mu ...:P#p|P]] = [[Complexity Zoo:P#pspace|PSPACE]], then [[Complexity Zoo:F#fpt|FPT]] = SLICEWISE PSPACE.

...ntion) is para-P, which is almost always known as [[Complexity Zoo:FPT#fpt|FPT]], which is equal to DTIME(f(k)n^c) for some constant c. para-P is a less common name for [[Complexity Zoo:F#fpt|FPT]], but in line with other [[#para|para-]] classes naming conventions. Its s