On the computational complexity of the minimum committee problem
From MaRDI portal
Publication:928677
DOI10.1007/s10852-006-9056-zzbMath1144.90468OpenAlexW2074464358MaRDI QIDQ928677
Publication date: 11 June 2008
Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10852-006-9056-z
Computational learning theory (68Q32) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Committee polyhedral separability: complexity and polynomial approximation ⋮ Computational complexity of combinatorial optimization problems induced by collective procedures in machine learning ⋮ Constraint elimination method for the committee problem
Cites Work
- The densest hemisphere problem
- A threshold of ln n for approximating set cover
- On the hardness of approximating minimization problems
- Basic Geometry of Voting
- The elements of statistical learning. Data mining, inference, and prediction
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item