Standard

Committee polyhedral separability: complexity and polynomial approximation. / Khachay, Michael.
In: Machine Learning, Vol. 101, No. 1-3, 10.2015, p. 231-251.

Research output: Contribution to journalArticlepeer-review

Harvard

APA

Vancouver

Khachay M. Committee polyhedral separability: complexity and polynomial approximation. Machine Learning. 2015 Oct;101(1-3):231-251. doi: 10.1007/s10994-015-5505-0

Author

Khachay, Michael. / Committee polyhedral separability: complexity and polynomial approximation. In: Machine Learning. 2015 ; Vol. 101, No. 1-3. pp. 231-251.

BibTeX

@article{c376f56d00c148028648d842a49ab51d,
title = "Committee polyhedral separability: complexity and polynomial approximation",
keywords = "Polyhedral separability, Affine committees, Computational complexity, Approximability, ALGORITHM, MAJORITY, NP",
author = "Michael Khachay",
year = "2015",
month = oct,
doi = "10.1007/s10994-015-5505-0",
language = "English",
volume = "101",
pages = "231--251",
journal = "Machine Learning",
issn = "0885-6125",
publisher = "Kluwer Academic Publishers",
number = "1-3",

}

RIS

TY - JOUR

T1 - Committee polyhedral separability: complexity and polynomial approximation

AU - Khachay, Michael

PY - 2015/10

Y1 - 2015/10

KW - Polyhedral separability

KW - Affine committees

KW - Computational complexity

KW - Approximability

KW - ALGORITHM

KW - MAJORITY

KW - NP

UR - http://www.scopus.com/inward/record.url?scp=84942368587&partnerID=8YFLogxK

UR - https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=tsmetrics&SrcApp=tsm_test&DestApp=WOS_CPL&DestLinkType=FullRecord&KeyUT=000361624700011

U2 - 10.1007/s10994-015-5505-0

DO - 10.1007/s10994-015-5505-0

M3 - Article

AN - SCOPUS:84942368587

VL - 101

SP - 231

EP - 251

JO - Machine Learning

JF - Machine Learning

SN - 0885-6125

IS - 1-3

ER -

ID: 297475