P

Initializing...

Theorem 1.3 — FPT implies quasipolynomial time $N^{(\log N)^{1+o(1)}}$ for every r.e. hypergraph class · Prove2Me