@InProceedings{arora:LIPIcs.STACS.2015.1,
author = {Arora, Sanjeev},
title = {{Overcoming Intractability in Unsupervised Learning}},
booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)},
pages = {1--1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-78-1},
ISSN = {1868-8969},
year = {2015},
volume = {30},
editor = {Mayr, Ernst W. and Ollinger, Nicolas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.1},
URN = {urn:nbn:de:0030-drops-49581},
doi = {10.4230/LIPIcs.STACS.2015.1},
annote = {Keywords: machine learning, unsupervised learning, intractability, NP-hardness}
}