On the calculation and approximation complexity of the minimal affine separating committee problem

MaRDI QIDQ3440997zbMATH OpenFDO

Authors M. Yu. Khachaĭ

Publication date 29 May 2007

zbMATH Keywords

approximationminimal affine separating committee problem

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computational learning theory (68Q32)

Recommendations

• scientific article; zbMATH DE number 5598224
• scientific article; zbMATH DE number 5592483
• Committee polyhedral separability: complexity and polynomial approximation
• scientific article; zbMATH DE number 5158920
• On the computational complexity of the minimum committee problem

Cited in

(6)

• scientific article; zbMATH DE number 5592483 (Why is no real title available?)
• scientific article; zbMATH DE number 5598224 (Why is no real title available?)
• Committee polyhedral separability: complexity and polynomial approximation
• On the computational complexity of the minimum committee problem
• Parallel computations and committee constructions
• Computational complexity of recognition learning procedures in the class of piecewise-linear committee decision rules

This page was built for publication: On the calculation and approximation complexity of the minimal affine separating committee problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3440997)