Improved algorithms via approximations of probability distributions (extended abstract)
From MaRDI portal
Publication:2817653
DOI10.1145/195058.195411zbMath1345.68270MaRDI QIDQ2817653
Aravind Srinivasan, Suresh Chari, Pankaj Rohatgi
Publication date: 1 September 2016
Published in: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/195058.195411
60E15: Inequalities; stochastic orderings
60C05: Combinatorial probability
68W25: Approximation algorithms
68W20: Randomized algorithms
Related Items
Unnamed Item, \(\varepsilon\)-discrepancy sets and their application for interpolation of sparse polynomials, Approximating hyper-rectangles: Learning and pseudorandom sets