首页    期刊浏览 2024年12月02日 星期一
登录注册

文章基本信息

  • 标题:On Basing Size-Verifiable One-Way Functions on NP-Hardness
  • 本地全文:下载
  • 作者:Andrej Bogdanov ; Christina Brzuska
  • 期刊名称:Electronic Colloquium on Computational Complexity
  • 印刷版ISSN:1433-8092
  • 出版年度:2014
  • 卷号:2014
  • 出版社:Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
  • 摘要:

    We prove that if the hardness of inverting a size-verifiable one-way function can be based on NP-hardness via a general (adaptive) reduction, then coAM is contained in NP. This claim was made by Akavia, Goldreich, Goldwasser, and Moshkovitz (STOC 2006), but was later retracted (STOC 2010).

国家哲学社会科学文献中心版权所有