Publisher
Springer Berlin Heidelberg
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. A Lower Bound for Sampling Disjoint Sets;ACM Transactions on Computation Theory;2020-07-23
2. How to Extract Useful Randomness from Unreliable Sources;Advances in Cryptology – EUROCRYPT 2020;2020
3. Sampling Lower Bounds: Boolean Average-Case and Permutations;SIAM Journal on Computing;2020-01
4. Quadratic Maps Are Hard to Sample;ACM Transactions on Computation Theory;2016-07-26