首页    期刊浏览 2024年07月05日 星期五
登录注册

文章基本信息

  • 标题:Proof vs. Truth in Computational Complexity
  • 本地全文:下载
  • 作者:Boaz Barak
  • 期刊名称:Electronic Colloquium on Computational Complexity
  • 印刷版ISSN:1433-8092
  • 出版年度:2012
  • 卷号:2012
  • 出版社:Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
  • 摘要:

    In this survey, I discuss the general question of what evidence can we use to predict the answer for open questions in computational complexity, as well as the concrete evidence currently known for two conjectures: Khot's Unique Games Conjecture and Feige's Random 3SAT Hypothesis.

  • 关键词:average case complexity; Unique Games Conjecture
国家哲学社会科学文献中心版权所有