Abstract
We consider k-threshold functions of n variables, i.e. the functions representable as the conjunction of k threshold functions. For n = 2, k = 2, we give upper bounds for the cardinality of the minimal teaching set depending on the various properties of the function.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have