Witness-preserving assignment tester Polynomial time algorithms f, f w : f: C    belongs to gap-3SAT5 f w : w  xif C(w)=1 then  (x)=1 With the most efficient probabilistically checkable proofs (Dinur 07 combined with BenSasson- Sudan 08) we have |  | = |C| polylog(k)
{}