Search
Home
Research units
Projects
Research output
Activities
Prizes
Staff
Press/Media
About
Committee polyhedral separability: complexity and polynomial approximation
Research output
:
Contribution to journal
›
Article
›
peer-review
Department of Mathematical Economics
Institute of Mathematics and Computer Science
Institute of Natural Sciences and Mathematics
Overview
Cite this
DOI
https://doi.org/10.1007/s10994-015-5505-0
Final published version
Michael Khachay
Original language
English
Pages (from-to)
231-251
Number of pages
21
Journal
Machine Learning
Volume
101
Issue number
1-3
DOIs
https://doi.org/10.1007/s10994-015-5505-0
Publication status
Published -
Oct 2015
ASJC Scopus subject areas
Artificial Intelligence
Research areas
Polyhedral separability, Affine committees, Computational complexity, Approximability, ALGORITHM, MAJORITY, NP
ID: 297475