373 search results - page 1 / 75 » On Deterministic Approximation of DNF |
STOC
1991
ACM
13 years 11 months ago
1991
ACM
STOC
2006
ACM
14 years 8 months ago
2006
ACM
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
ALT
2010
Springer
13 years 9 months ago
2010
Springer
We show that random DNF formulas, random log-depth decision trees and random deterministic finite acceptors cannot be weakly learned with a polynomial number of statistical queries...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
We study the problem of finding the minimum size DNF formula for a function f : {0, 1}d → {0, 1} given its truth table. We show that unless NP ⊆ DTIME(npoly(log n) ), there i...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
Say that f : {0, 1}n → {0, 1} -approximates g : {0, 1}n → {0, 1} if the functions disagree on at most an fraction of points. This paper contains two results about approximatio...