平均复杂度和伪随机的列表解码

2006 IEEE Information Theory Workshop - ITW '06 Punta del Este Pub Date : 2006-03-13 DOI:10.1109/ITW.2006.1633776

V. Guruswami

{"title":"平均复杂度和伪随机的列表解码","authors":"V. Guruswami","doi":"10.1109/ITW.2006.1633776","DOIUrl":null,"url":null,"abstract":"This is a brief survey into the applications of list decoding in complexity theory, specifically in relating the worst-case and average-case complexity of computational problems, and in construction of pseudorandom generators. Since we do not have space for full proofs, the aim is to give a flavor of the utility of list decoding in these settings together with pointers to where further details can be found.","PeriodicalId":293144,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"List Decoding in Average-Case Complexity and Pseudorandomness\",\"authors\":\"V. Guruswami\",\"doi\":\"10.1109/ITW.2006.1633776\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This is a brief survey into the applications of list decoding in complexity theory, specifically in relating the worst-case and average-case complexity of computational problems, and in construction of pseudorandom generators. Since we do not have space for full proofs, the aim is to give a flavor of the utility of list decoding in these settings together with pointers to where further details can be found.\",\"PeriodicalId\":293144,\"journal\":{\"name\":\"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este\",\"volume\":\"52 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-03-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW.2006.1633776\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE Information Theory Workshop - ITW '06 Punta del Este","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW.2006.1633776","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 8

摘要

本文简要介绍了列表解码在复杂性理论中的应用，特别是在计算问题的最坏情况和平均情况复杂性方面，以及在伪随机生成器的构造方面。由于我们没有足够的空间来提供完整的证明，因此我们的目的是在这些设置中提供列表解码的实用程序，以及可以找到进一步细节的指针。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

List Decoding in Average-Case Complexity and Pseudorandomness

This is a brief survey into the applications of list decoding in complexity theory, specifically in relating the worst-case and average-case complexity of computational problems, and in construction of pseudorandom generators. Since we do not have space for full proofs, the aim is to give a flavor of the utility of list decoding in these settings together with pointers to where further details can be found.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2006 IEEE Information Theory Workshop - ITW '06 Punta del Este

自引率

0.00%

发文量

期刊最新文献

Backward Channels in Multiterminal Source Coding Regret Minimization Under Partial Monitoring Scaling Law of the Sum-Rate for Multi-Antenna Broadcast Channels with Deterministic or Selective Binary Feedback Non-coherent Mutual Information of the Multipath Rayleigh Fading Channel in the Low SNR Regime Successive Refinement for Pattern Recognition