The following pages link to (Q3395298):
Displaying 8 items.
- Scheme of boosting in the problems of combinatorial optimization induced by the collective training algorithms (Q463372) (← links)
- Lower bounds for the number of hyperplanes separating two finite sets of points (Q492284) (← links)
- Committee polyhedral separability: complexity and polynomial approximation (Q890319) (← links)
- On the computational complexity of the minimum committee problem (Q928677) (← links)
- Constraint elimination method for the committee problem (Q2261721) (← links)
- ON PARAMETERIZED COMPLEXITY OF HITTING SET PROBLEM FOR AXIS–PARALLEL SQUARES INSTERSECTING A STRAIGHT LINE (Q4581438) (← links)
- (Q5325265) (← links)
- Polynomial-Time Separation of a Superclass of Simple Comb Inequalities (Q5388004) (← links)
