P
Initializing...
Theorem 9 — Algorithm closestSubstring is a PTAS: cost ≤ (1 + 1/(2r−1) + 3εr)·d_opt with probability ≥ 1 − 2(nm)^{−1/3}, with polynomially many candidates · Prove2Me