Improved Average-Case Lower Bounds for De Morgan Formula Size
Main Theorem:Learninglog(?)-sparse parities requires either Ω(?⋅log0.99?)memory bits or ?Ωloglog? number of samples. Implies same bounds for learning. ... Improved Average-Case Lower Bounds for De Morgan Formula Size