| References |
Khachai, Mu., On computational complexity of the minimal committee problem and related problems (2006) Dokl. Ross. Akad. Nauk, 406 (6), pp. 742-745; Mazurov, V.D., Khachai, M.Yu., Parallel computations and committee constructions (2007) Autom. Remote Control, (5), pp. 912-921; Khachai, M.Yu., Computational and approximational complexity of combinatorial problems related to the committee polyhedral separability of finite sets (2008) Pattern Recognit. Image Anal., 18 (2), pp. 237-242; Lin, J.H., Vitter, J.S., Complexity results on learning by neural nets (1991) Machine Learning, (6), pp. 211-230; Megiddo, N., On the complexity of polyhedral separability (1988) Discrete Comput. Geometry, (3), pp. 325-337; Khachai, M.Yu., (2006) Tavrich. Vest. Inform. Mat., (1), pp. 34-43; Mazurov, V., (1971) Committees of Inequality Systems and Pattern Recognition Problem, (3), pp. 140-146. , Kibernetika; Blum, A.L., Rivest, R.L., Training a 3-node neural network is NP-complete (1992) Neural Networks, (5), pp. 117-127; Megiddo, N., Tamir, A., On the complexity of locating linear facilities in the plane (1982) Oper. Res. Lett., 1 (5), pp. 194-197; Khachai, M.Yu., Poberii, M.I., Computational complexity of the problems of committee polyhedral separability in the fixed-dimensionality spaces (2008) Tavrich. Vest. Inform. Mat., (2), pp. 218-227; Eremin, I.I., Astaf'ev, N.N., Vvedenie v teoriyu lineinogo i vypuklogo programmirovaniya (1975) Introduction to the Theory of Linear and Convex Programming, , Moscow: Fizmatlit; Kumar, V.S., Arya, S., Ramesh, H., Hardness of set cover with intersection 1, in automata, languages and programming (2000) Proc. ICALP-00, 1853, pp. 624-635. , Berlin: Springer; Johnson, D.S., Approximation algorithms for combinatorial problems (1974) J. Comput. Syst. Sci., 9 (3), pp. 256-278 |