One-Way Functions and the Berman-Hartmanis Conjecture

@article{Agrawal2009OneWayFA,
  title={One-Way Functions and the Berman-Hartmanis Conjecture},
  author={Manindra Agrawal and Osamu Watanabe},
  journal={2009 24th Annual IEEE Conference on Computational Complexity},
  year={2009},
  pages={194-202}
}
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… Expand
A Candidate Counterexample to the Easy Cylinders Conjecture
  • Oded Goldreich
  • Mathematics, Computer Science
  • Electron. Colloquium Comput. Complex.
  • 2009
A Thirty Year Old Conjecture about Promise Problems
Collapsing and Separating Completeness Notions Under Average-Case and Worst-Case Hypotheses
Length-Increasing Reductions for PSPACE-Completeness
Strong Reductions and Isomorphism of Complete Sets
A thirty Year old conjecture about promise problems
Nonuniform Reductions and NP-Completeness
The Isomorphism Conjecture for NP
Investigations Concerning the Structure of Complete Sets

References

SHOWING 1-10 OF 27 REFERENCES
One-Way Functions and the Isomorphism Conjecture
One-Way Functions and the Isomorphism Conjecture
  • K. Ganesan
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 1994
The isomorphism conjecture fails relative to a random oracle
A Candidate Counterexample to the Easy Cylinders Conjecture
  • Oded Goldreich
  • Mathematics, Computer Science
  • Electron. Colloquium Comput. Complex.
  • 2009
Pseudo-random generators and structure of complete degrees
  • Manindra Agrawal
  • Mathematics, Computer Science
  • Proceedings 17th IEEE Annual Conference on Computational Complexity
  • 2002
On Isomorphisms and Density of NP and Other Complete Sets
Juris Hartmanis: fundamental contributions to isomorphism problems
  • P. Young
  • Mathematics, Computer Science
  • [1988] Proceedings. Structure in Complexity Theory Third Annual Conference
  • 1988
Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem
Some Remarks on Witness Functions for Nonpolynomial and Noncomplete Sets in NP
Some Remarks on Witness Functions for Nonpolynomial and Noncomplete Sets in NP
...
1
2
3
...