Computational complexity of recognition learning procedures in the class of piecewise-linear committee decision rules

Two new results concerned with the computational and approximation complexities of the combinatorial optimization problems arising at learning pattern recognition in the class of committee piecewise-linear decision rule were discussed.

Presented by the member of Editorial Board: A. I. Kibzun