The NP-completeness column: an ongoing guide
Journal of Algorithms
On one-way functions and polynomial-time isomorphisms
Theoretical Computer Science
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
The ismorphism conjecture fails relative to a random oracle
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Fast Turing deductions of combinatorial problems and their algorithms
Proceedings of the third international conference on Combinatorial mathematics
One-way functions and the nonisomorphism of NP-complete sets
Theoretical Computer Science
Some remarks on polynomial time isomorphisms
ICCI'90 Proceedings of the international conference on Advances in computing and information
Oracles for structural properties: the isomorphism problem and public-key cryptography
Journal of Computer and System Sciences
The computational complexity of universal hashing
Theoretical Computer Science - Special issue on structure in complexity theory
An introduction to Kolmogorov complexity and its applications
An introduction to Kolmogorov complexity and its applications
Linear Time Algorithms and NP-Complete Problems
SIAM Journal on Computing
On the complexity of the parity argument and other inefficient proofs of existence
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
A taxonomy of complexity classes of functions
Journal of Computer and System Sciences
On the NP-isomorphism problem with respect to random instances
Journal of Computer and System Sciences
Satisfiability Is Quasilinear Complete in NQL
Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On Using Oracles That Compute Values
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
A First-Order Isomorphism Theorem
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Quasilinear Time Complexity Theory
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Proceedings of the Symposium on Logical Foundations of Computer Science: Logic at Botik '89
One-way Functions and Isomorphism Conjecture
Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
We show that all the basic facts about the Berman-Hartmanis Isomorphism Conjecture carry over from polynomial to quasilinear time bounds. However, we show that the connection between unique-accepting NTMs and one-way functions, which underlies much subsequent work on the B-H conjecture, breaks down for quasilinear time under relativizations. Hence we have a whole new ballgame, on a tighter playing field.