Computational complexity of recognition learning procedures in the class of piecewise-linear committee decision rules

DOI10.1134/S0005117910030136zbMath1228.90096MaRDI QIDQ1956909

Mikhail Yu. Khachay

Publication date: 24 September 2010

Published in: Automation and Remote Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27)

Related Items (1)

The computational complexity and approximability of a series of geometric covering problems

Cites Work

• Computational complexity of the minimum committee problem and related problems
• On the complexity of polyhedral separability
• Approximation algorithms for combinatorial problems
• On the complexity of locating linear facilities in the plane
• Parallel computations and committee constructions
• Unnamed Item
• Unnamed Item

This page was built for publication: Computational complexity of recognition learning procedures in the class of piecewise-linear committee decision rules