Faster Sublinear Algorithms using Conditional Sampling

DOI10.1137/1.9781611974782.114zbMath1410.68388arXiv1608.04759OpenAlexW2952046009MaRDI QIDQ4575859

Manolis Zampetakis, Themistoklis Gouleakis, Christos Tzamos

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1608.04759

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Randomized algorithms (68W20)

Related Items (1)

Efficient parameter estimation of truncated Boolean product distributions

This page was built for publication: Faster Sublinear Algorithms using Conditional Sampling