sentence1: in contrast , angluin and kharitonov showed that , under cryptographic assumptions , membership queries do not help in pac-learning unrestricted dnf formulas .
sentence2: however , angluin and kharitonov have shown that learning cfgs from membership and equivalence queries is intractable under plausible cryptographic assumptions .