Isomorphisms and 1-L reductions

  • Eric W. Allender
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 223)


All sets complete for NP under 1-L reductions are complete under length-increasing, invertible, and “almost one-one” ≤ m p reductions. All sets complete for PSPACE under 1-L reductions are p-isomorphic.


Turing Machine Complexity Class Input Symbol Invertible Function Marked Vertex 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Al-85]
    E. W. Allender, Invertible functions, Doctoral Dissertation, Georgia Institute of Technology.Google Scholar
  2. [Al-86]
    E. W. Allender, The complexity of sparse sets in P, These Proceedings.Google Scholar
  3. [Be-77]
    L. Berman, Polynomial reducibilities and complete sets, Doctoral Dissertation, Cornell University.Google Scholar
  4. [BH-77]
    L. Berman and J. Hartmanis, On isomorphisms and density of NP and other complete sets, SIAM J. Comput. 6, 305–323.Google Scholar
  5. [Do-82]
    M. Dowd, Isomorphism of complete sets, Technical Report LCSR-TR-34, Rutgers University.Google Scholar
  6. [HIM-78]
    J. Hartmanis, N. Immerman, and S. Mahaney, One-way log-tape reductions, Proc. 19th IEEE Symposium on Foundations of Computer Science, pp. 65–72.Google Scholar
  7. [HM-81]
    J. Hartmanis and S. Mahaney, Languages simultaneously complete for one-way and two-way log-tape automata, SIAM J. Comput. 10, 383–390.Google Scholar
  8. [HU-79]
    J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, Mass.Google Scholar
  9. [Hu-85]
    D. T. Huynh, Non-uniform complexity and the randomness of certain complete languages, Technical Report TR 85-34, Computer Science Department, Iowa State University.Google Scholar
  10. [JY-85]
    D. Joseph and P. Young, Some remarks on witness functions for non-polynomial and non-complete sets in NP, Theoretical Computer Science 39, 225–237.Google Scholar
  11. [KLD-86]
    K.-I. Ko, T. J. Long, and D.-Z. Du, A note on one-way functions and polynomial-time isomorphisms, to appear.Google Scholar
  12. [MY-85]
    S. Mahaney and P. Young, Reductions among polynomial isomorphism types, Theoretical Computer Science 39, 207–224.Google Scholar
  13. [St-74]
    L. J. Stockmeyer, The complexity of decision problems in automata theory and logic, Doctoral Dissertation, M.I.T.Google Scholar
  14. [Wa-85]
    Osamu Watanabe, On one-one polynomial time equivalence relations, Theoretical Computer Science 38, 157–165.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Eric W. Allender
    • 1
  1. 1.Department of Computer ScienceRutgers UniversityNew BrunswickUSA

Personalised recommendations