The following pages link to (Q5325265):
Displaying 4 items.
- Computing the complexity for Schelling segregation models (Q718797) (← links)
- Committee polyhedral separability: complexity and polynomial approximation (Q890319) (← links)
- Computational complexity of recognition learning procedures in the class of piecewise-linear committee decision rules (Q1956909) (← links)
- (Q3395298) (← links)