@InProceedings{celis_et_al:LIPIcs.APPROX-RANDOM.2017.36,
author = {Celis, L. Elisa and Deshpande, Amit and Kathuria, Tarun and Straszak, Damian and Vishnoi, Nisheeth K.},
title = {{On the Complexity of Constrained Determinantal Point Processes}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)},
pages = {36:1--36:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-044-6},
ISSN = {1868-8969},
year = {2017},
volume = {81},
editor = {Jansen, Klaus and Rolim, Jos\'{e} D. P. and Williamson, David P. and Vempala, Santosh S.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2017.36},
URN = {urn:nbn:de:0030-drops-75851},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2017.36},
annote = {Keywords: determinantal point processes, constraints, matroids, sampling and counting, polynomials, mixed discriminant}
}