Some Fundamental Insights of Computational Complexity Theory计算复杂性理论的一些基本观点.pptVIP

下载本文档

0
0
约3.48千字
约 15页
2018-04-16 发布于江西
举报
版权申诉

Some Fundamental Insights of Computational Complexity Theory计算复杂性理论的一些基本观点.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文档。上传文档

Some FundamentalInsights of ComputationalComplexity Theory Avi Wigderson IAS, Princeton, NJ Hebrew University, Jerusalem Complexity of Functions Complexity Classes COLORING PLANAR MAPS NP - COMPLETENESS CRYPTOGRAPHY [DH] OBLIVIOUS COMPUTATION [Y] PRIVACY vs. FAULT TOLERANCE METRICS ON PROB. DISTRIBUTIONS COMPUTATIONAL ENTROPY ? [BMY] PSEUDO-RANDOM GENERATORS HARDNESS vs. RANDOMNESS OPEN PROBLEMS * ADD MULT PRIME FACTOR Permanent #P Counting Problems Non-DET [Efficient Verification] Efficient Prob. Time Efficient DET. Time Memory Efficient ALGS Satisfyability NP 3-Coloring Discrete Log Factoring Primality testing RP Verifying polynomial identities Max Flow P Linear Programming Determinant L Graph Connectivity ? F E A S I B L E COMP COMP Axiom: FACTORING is HARD ? FORMAL RIGOROUS theorems COMPUTATION FEASIBLE CANNOT SIMULATE NATURE RANDOMNESS ENTROPY CRYPTOGRAPHY KNOWLEDGE LEARNING PROOFS COMPUTATIONAL IS WEAK NO FEASIBLE OF COMPUTATIONAL HARDNESS EFFICIENT OF SOME NATURAL CONCEPTS IS IMPOSSIBLE ZERO PROOFS FOR EVERY THEOREM EVERY PROBLEM HAS A SECURE PROTOCOL COMPUTATIONAL CAN BE DETERMINISTICALLY INCREASED THM [AH] EVERY PLANAR MAP IS 4-COLORABLE FACT NOT EVERY PLANAR MAP IS 3-COLORABLE 3-COL THM: IF 3-COL IS EASY THEN FACTOR IS EASY NP – EFFICIENTLY VERIFIABLE PROOFS EFFICIENT REDUCTIONS COMPLETENESS TRIVIAL: 3-COL, FACTOR TRIVIAL: IS TRANSITIVE! THM[C,L,K,S]: 3-COL is NP-Complete P = NP? Among the most important scientific open problems DIGITAL ENVELOPE [GM] [R] [RSA] ALL PARTIES FEASIBLE COMPUTERS ? PUBLIC KEY ENCRYPTION ? DIGITAL SIGNATURES ? THE MILLIONAIRE’S PROBLEM ? EVERYTHING! ? CONTRACT SIGNING ? ? ? PLAYING POKER ? ? EASY MULT FACTOR HARD ALICE BOB || || ? ? ? ? ? ? ? ? f(x,y) f(x,y) SMALL BOOLEAN CIRCUIT ?NO CHEATERS! ? a b ? COMPLETE PROBLEM ? a b a? b ? COMPLETE PROBLEM ?MANY PLAYER