The Zigzag Graph Product and Constant-Degree Lossless …锯齿形图的产品和恒度无损….pptVIP

下载本文档

4
0
约1.03万字
约 32页
2018-06-24 发布于四川
举报
版权申诉

The Zigzag Graph Product and Constant-Degree Lossless …锯齿形图的产品和恒度无损….ppt

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

The Zigzag Graph Product and Constant-Degree Lossless …锯齿形图的产品和恒度无损…

Extractors: Optimal Up to Constant Factors Avi Wigderson IAS, Princeton Hebrew U., Jerusalem Joint work with Chi-Jen Lu, Omer Reingold, Salil Vadhan. To appear: STOC 03 Original Motivation[B84,SV84,V85,VV85,CG85,V87,CW89,Z90-91] Randomization is pervasive in CS Algorithm design, cryptography, distributed computing, … Typically assume perfect random source. Unbiased, independent random bits Can we use a “weak” random source? (Randomness) Extractors: convert weak random sources into almost perfect randomness. Extractors [Nisan Zuckerman `93] X has min-entropy k (? is a k-source) if ?x Pr[X = x] ? 2-k (i.e. no heavy elements). Extractors [Nisan Zuckerman `93] X has min-entropy k (? is a k-source) if ?x Pr[X = x] ? 2-k (i.e. no heavy elements). Measure of closeness: statistical difference (a.k.a. variation distance, a.k.a. half L1-norm). Applications of Extractors Derandomization of error reduction in BPP [Sip88, GZ97, MV99,STV99] Derandomization of space-bounded algorithms [NZ93, INW94, RR99, GW02] Distributed Network Algorithms [WZ95, Zuc97, RZ98, Ind02]. Hardness of Approximation [Zuc93, Uma99, MU01] Cryptography [CDHKS00, MW00, Lu02 Vad03] Data Structures [Ta02] Unifying Role of Extractors Extractors are intimately related to: Hash Functions [ILL89,SZ94,GW94] Expander Graphs [NZ93, WZ93, GW94, RVW00, TUZ01, CRVW02] Samplers [G97, Z97] Pseudorandom Generators [Trevisan 99, …] Error-Correcting Codes [T99, TZ01, TZS01, SU01, U02] ? Unify the theory of pseudorandomness. Extractors as graphs Extractors - Parameters Goals: minimize d, maximize m. Non-constructive optimal [Sip88,NZ93,RT97]: Seed length d = log(n-k) + 2 log 1/? + O(1). Output length m = k + d - 2 log 1/? - O(1). Extractors - Parameters Goals: minimize d, maximize m. Non-constructive optimal [Sip88,NZ93,RT97]: Seed length d = log n + O(1). Output length m = k + d - O(1). Explicit Constructions A large body of work [..., NZ93, WZ93, GW94, SZ94, SSZ95, Zuc96, Ta96, Ta98, Tre99, RRV9