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. Illustr. 6, bibliogr. 9.