Isomorphisms and 1-L reductions

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations


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.

Original languageEnglish (US)
Title of host publicationStructure in Complexity Theory - Proceedings of the Conference held at the University of California
EditorsAlan L. Selman
PublisherSpringer Verlag
Number of pages11
ISBN (Print)9783540164869
StatePublished - 1986
EventStructure in Complexity Theory Conference, 1986 - Berkeley, United States
Duration: Jun 2 1986Jun 5 1986

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume223 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


OtherStructure in Complexity Theory Conference, 1986
Country/TerritoryUnited States

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Isomorphisms and 1-L reductions'. Together they form a unique fingerprint.

Cite this