Khachay, M. (2015). Committee polyhedral separability: Complexity and polynomial approximation. Machine learning, 101(1-3), 231-251. https://doi.org/10.1007/s10994-015-5505-0
Chicago Style (17th ed.) CitationKhachay, Michael. "Committee Polyhedral Separability: Complexity and Polynomial Approximation." Machine Learning 101, no. 1-3 (2015): 231-251. https://doi.org/10.1007/s10994-015-5505-0.
MLA (9th ed.) CitationKhachay, Michael. "Committee Polyhedral Separability: Complexity and Polynomial Approximation." Machine Learning, vol. 101, no. 1-3, 2015, pp. 231-251, https://doi.org/10.1007/s10994-015-5505-0.
Warning: These citations may not always be 100% accurate.