Complexity Theoretic Limitations on Learning DNF'sDownload PDFOpen Website

2016 (modified: 03 Nov 2022)COLT 2016Readers: Everyone
Abstract: Using the recently developed framework of Daniely, Linial and Shalev-Shwartz, we show that under a natural assumption on the complexity of random K-SAT, learning DNF formulas is hard. Furthermore, ...
0 Replies

Loading