117
click to vote
ICANN
2007
Springer
15 years 9 months ago
2007
Springer
Finding the largest linearly separable set of examples for a given Boolean function is a NP-hard problem, that is relevant to neural network learning algorithms and to several prob...