Simpler Distribution Testing with Little Memory
SIAM Symposium on Simplicity in Algorithms(2023)
摘要
We consider the question of distribution testing (specifically, uniformity
and closeness testing) in the streaming setting, \ie under stringent memory
constraints. We improve on the results of Diakonikolas, Gouleakis, Kane, and
Rao (2019) by providing considerably simpler algorithms, which remove some
restrictions on the range of parameters and match their lower bounds.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要