Improved algorithms via approximations of probability distributions (extended abstract)

DOI10.1145/195058.195411zbMath1345.68270OpenAlexW2098342997MaRDI QIDQ2817653

Pankaj Rohatgi, Suresh Chari, Aravind Srinivasan

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

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Combinatorial probability (60C05) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (3)

Unnamed Item ⋮ \(\varepsilon\)-discrepancy sets and their application for interpolation of sparse polynomials ⋮ Approximating hyper-rectangles: Learning and pseudorandom sets

This page was built for publication: Improved algorithms via approximations of probability distributions (extended abstract)