no code implementations • 13 Apr 2014 • Amit Daniely, Shai Shalev-Shwatz
Using the recently developed framework of [Daniely et al, 2014], we show that under a natural assumption on the complexity of refuting random K-SAT formulas, learning DNF formulas is hard.
