NP = { L : there exists f,d s.t
soundness x e L y, |y|<|x|d , f(x,y) = 1
completeness x e L y, f(x,y) = 1}
EX: L = 3 colorable graphs
E
A