Summary: One-Way Functions and the Berman-Hartmanis
Conjecture
Manindra Agrawal
Dept. of Computer Science
IIT Kanpur
Kanpur, India
Email: manindra(at)iitk.ac.jp
Osamu Watanabe
Dept. of Math. & Comp. Sci.
Tokyo Inst. of Tech.
Tokyo, Japan
Email: watanabe(at)is.titech.ac.jp
Abstract--The Berman-Hartmanis conjecture states that all
NP-complete sets are P-isomorphic each other. On this conjecture,
we first improve the result of [3] and show that all NP-complete
sets are
p/poly
li,1-1 -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

Source: Agrawal, Manindra - Department of Computer Science and Engineering, Indian Institute of Technology Kanpur

Collections: Computer Technologies and Information Sciences