Computational complexity of recognition learning procedures in the class of piecewise-linear committee decision rules
type: Item
instance of: scholarly article
title: Computational complexity of recognition learning procedures in the class of piecewise-linear committee decision rules
zbMATH Open document ID: 1228.90096
DOI: 10.1134/S0005117910030136
published in: Automation and Remote Control
publication date: 2010-09-24T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 5790901
author: M. Yu. Khachaĭ
MaRDI profile type: Publication
cites work: Computational complexity of the minimum committee problem and related problems
cites work: Parallel computations and committee constructions
cites work: On the complexity of polyhedral separability
cites work: Q3440997
cites work: On the complexity of locating linear facilities in the plane
cites work: Q2754182
cites work: Approximation algorithms for combinatorial problems
description: scientific article; zbMATH DE number 5790901