One-Way Functions and the Berman-Hartmanis Conjecture

Manindra Agrawal, O. Watanabe
{"title":"One-Way Functions and the Berman-Hartmanis Conjecture","authors":"Manindra Agrawal, O. Watanabe","doi":"10.1109/CCC.2009.17","DOIUrl":null,"url":null,"abstract":"The Berman-Hartmanis conjecture states that all NP-complete sets are P-isomorphic each other. On this conjecture, we first improve the previous result of Agrawal and show that all NP-complete sets are P/poly-time computable 1,li-reducible to each other based on the assumption that there exist regular one-way functions that cannot be inverted by randomized polynomial-time algorithms. Secondly, we show that, besides the above assumption, if all one-way functions have some easy part to invert, then all NP-complete sets are P/poly-isomorphic to each other.","PeriodicalId":158572,"journal":{"name":"2009 24th Annual IEEE Conference on Computational Complexity","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 24th Annual IEEE Conference on Computational Complexity","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCC.2009.17","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

The Berman-Hartmanis conjecture states that all NP-complete sets are P-isomorphic each other. On this conjecture, we first improve the previous result of Agrawal and show that all NP-complete sets are P/poly-time computable 1,li-reducible to each other based on the assumption that there exist regular one-way functions that cannot be inverted by randomized polynomial-time algorithms. Secondly, we show that, besides the above assumption, if all one-way functions have some easy part to invert, then all NP-complete sets are P/poly-isomorphic to each other.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
单向函数与Berman-Hartmanis猜想
Berman-Hartmanis猜想指出所有的np完全集合彼此是p同构的。在这个猜想上,我们首先改进了Agrawal先前的结果,并基于存在不能被随机化多项式时间算法反转的正则单向函数的假设,证明了所有np -完备集是P/多时间可计算的1,li-彼此可约的。其次,我们证明了除上述假设外,如果所有的单向函数都有一些容易被反转的部分,那么所有的np完全集合彼此是P/多同构的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Planar Graph Isomorphism is in Log-Space Increasing the Gap between Descriptional Complexity and Algorithmic Probability Every Permutation CSP of arity 3 is Approximation Resistant Lower Bounds on Quantum Multiparty Communication Complexity The Maximum Communication Complexity of Multi-Party Pointer Jumping
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1