{"title":"论唯一游戏猜想(邀请调查)","authors":"Subhash Khot","doi":"10.1109/SFCS.2005.61","DOIUrl":null,"url":null,"abstract":"This article surveys recently discovered connections between the Unique Games Conjecture and computational complexity, algorithms, discrete Fourier analysis, and geometry.","PeriodicalId":328781,"journal":{"name":"2010 IEEE 25th Annual Conference on Computational Complexity","volume":"268 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"95","resultStr":"{\"title\":\"On the Unique Games Conjecture (Invited Survey)\",\"authors\":\"Subhash Khot\",\"doi\":\"10.1109/SFCS.2005.61\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This article surveys recently discovered connections between the Unique Games Conjecture and computational complexity, algorithms, discrete Fourier analysis, and geometry.\",\"PeriodicalId\":328781,\"journal\":{\"name\":\"2010 IEEE 25th Annual Conference on Computational Complexity\",\"volume\":\"268 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-10-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"95\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE 25th Annual Conference on Computational Complexity\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SFCS.2005.61\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE 25th Annual Conference on Computational Complexity","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SFCS.2005.61","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 95
摘要
本文调查了最近发现的Unique Games Conjecture与计算复杂性、算法、离散傅立叶分析和几何之间的联系。
This article surveys recently discovered connections between the Unique Games Conjecture and computational complexity, algorithms, discrete Fourier analysis, and geometry.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
