P

Initializing...

Theorem 9.7 — an additive-$a(T)$ estimator with $2a(S(N, k(N))) < k(N)$ gives a 3-SAT algorithm in time $S(N, k(N))^{O(1)}$ · Prove2Me