Pages that link to "Item:Q928677"
From MaRDI portal
The following pages link to On the computational complexity of the minimum committee problem (Q928677):
Displaying 3 items.
- Computational complexity of combinatorial optimization problems induced by collective procedures in machine learning (Q643804) (← links)
- Committee polyhedral separability: complexity and polynomial approximation (Q890319) (← links)
- Constraint elimination method for the committee problem (Q2261721) (← links)