| References |
Mazurov, V.D., On the Committee of a System of Convex Inequalities (1966) Proc. Int. Math. Congr, (14), p. 41. , Moscow: Mosk. Gos. Univ; Mazurov, V.D., (1990) Metod komitetov v zadachakh optimizatsii i klassifikatsii (Method of Committees in the Problems of Optimization and Classification), , Moscow: Nauka; Mazurov, V.D., Consistent Completion of Systems of Algorithms to Committee Technologies (1998) Pattern Recognit. Image Anal, 8 (4), pp. 501-506; Ablow, C.M., Kaylor, D.J., Inconsistent Homogeneous Linear Inequalities (1965) Bull. Am. Math. Soc, 71 (5), p. 724; Judd, J.S., (1990) Neural Network Design and Complexity of Learning, , New York: MIT Press; Lin, J.H., Vitter, J.S., Complexity Results on Learning by Neural Nets (1991) Machine Learning, 6, pp. 211-230; Blum, A.L., Rivest, R.L., Training a 3-node Neural Network is NP-complete (1992) Neural Networks, 5, pp. 117-127; Mazurov, V.D., Committees of Inequality Systems and the Problem of Recognition (1971) Kibernetika, (3), pp. 140-146; Khachai, M.Y., On Computational Complexity of the Minimal Committee and Related Problems (2006) Dokl. Ross. Akad. Nauk, 406 (6), pp. 742-745; Hastad, J., Clique is Hard to Approximate within n1-ε (1999) Acta Mathematica, 182 (13), pp. 105-142; Dinur, I., Regev, O., Smyth, C., The Hardness of 3-uniform Hypergraph Coloring (2002) Proc. 43rd Ann. IEEE Sympos. Foundat. Comput. Sci; Khachai, M.Y., On the Computational and Approximational Complexity of the Problem of Minimal Separating Committee (2006) Tavrich. Vest. Informatiki i Mat, (1), pp. 34-43 |