Complete Problems and Strong Polynomial Reducibilities

[1]  Ding-Zhu Du,et al.  A note on one-way functions and polynomial-time isomorphisms , 1986, STOC '86.

[2]  Larry Joseph Stockmeyer,et al.  The complexity of decision problems in automata theory and logic , 1974 .

[3]  Ding-Zhu Du,et al.  On One-Way Functions and Polynomial-Time Isomorphisms , 1986, Theor. Comput. Sci..

[4]  Stuart A. Kurtz,et al.  Collapsing degrees , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[5]  Eric Allender.  Isomorphisms and 1-L Reductions , 1988, J. Comput. Syst. Sci..

[6]  Neil Immerman,et al.  One-way log-tape reductions , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[7]  L. Berman.  Polynomial reducibilities and complete sets. , 1977 .

[8]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[9]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[10]  Juris Hartmanis,et al.  On Isomorphisms and Density of NP and Other Complete Sets , 1977, SIAM J. Comput..

[11]  Osamu Watanabe.  On One-One Polynomial Time Equivalence Relations , 1985, Theor. Comput. Sci..