| References |
Blum, A.L., Rivest, R.L., Training a 3-node neural network is NP-complete (1992) Neural Networks, 5, pp. 117-127; Eremin, I.I., Astafiev, N.N., Introduction into the Theory of Linear and Convex Programming. Phys (1975) Mat. Lit, , in Russian, Moscow, 192 pp; Johnson, D.S., Approximation algorithms for combinatorial problems (1974) Journal of Computer and System Sciences, 9 (3), pp. 256-278; Khachai, M.Y., On the computational complexity of minimum committee problem and related problems (2006) Doklady Mathematics, 73 (1), pp. 138-141; Khachay, M.Y., On the computational and approximational complexity of the minimum affine separating committee problem (2006) Tavricheskii Vestnik Informatiki i Matematiki, 1, pp. 34-43. , in Russian; Khachai, M.Y., Computational and approximational complexity of combinatorial problems related to the committee polyhedral separability of finite sets (2008) Pattern Recognition and Image Analysis, 18 (2), pp. 237-242; Khachai, M.Yu., and M.I. Pobery (2008). Computational complexity and approximability of combinatorial optimization problems connected with committee poplyhedral separability of finite sets. In 20th Intern. Conf. EURO Mini Conf. Continuous Optimiz. & Knowledge-Based Technolog. (EurOPT-2008). Selected papers. Technika, Vilnius. pp. 42-47; Lin, J.H., Vitter, J.S., Complexity results on learning by neural nets (1991) Machine Learning, 6, pp. 211-230; Mazurov, V.D., Committees of inequalities systems and the pattern recognition problem (1971) Kibernetika, 3, pp. 140-146. , in Russian; Megiddo, N., Tamir, A., On the complexity of locating linear facilities in the plane (1982) Operations Research Letters, 5 (1), pp. 194-197; Megiddo, N., On the complexity of polyhedral separability (1988) Discrete and Computational Geometry, 3, pp. 325-337 |