Analysis of upper bound in Valiant's model for learning bounded CNF expressions
Shankar Vaidyanathan, S. Lakshmivarahan · 1993
I%ispaper deAbeaa cridcal analysisof the learningof * special chases of Boolean eqreaaions, ViZ., bounded Conjunctive Normal Form (k-CNF) and Monotone Monomials under valiant's hnework.Baaed on the simulations of these learning ~followed by q comparative study of the thamtid and experimental results, significant improvements on k basic upper and lower bounds have been proposed