Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing 2016
DOI: 10.1145/2897518.2897528
|View full text |Cite
|
Sign up to set email alerts
|

Explicit two-source extractors and resilient functions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
84
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 81 publications
(86 citation statements)
references
References 51 publications
0
84
0
Order By: Relevance
“…The proof of Theorem 2.1 is similar to the arguments in [CZ15] and relies on Janson's inequality. However, our argument is more subtle as we need to handle (d, k, δ)-designs and not just d-designs as is done there.…”
Section: Overview Of Constructionmentioning
confidence: 90%
See 4 more Smart Citations
“…The proof of Theorem 2.1 is similar to the arguments in [CZ15] and relies on Janson's inequality. However, our argument is more subtle as we need to handle (d, k, δ)-designs and not just d-designs as is done there.…”
Section: Overview Of Constructionmentioning
confidence: 90%
“…One of the main building blocks of their work is an efficiently computable resilient function with a stronger guarantee described below. We noticeably simplify the construction and analysis of [CZ15] and obtain better quantitative bounds. We explain these next starting with the definitions of extractors.…”
Section: Two-source Extractorsmentioning
confidence: 99%
See 3 more Smart Citations