Abstract
All sets complete for NP under 1-L reductions are complete under length-increasing, invertible, and “almost one-one” ≤mp reductions. All sets complete for PSPACE under 1-L reductions are p-isomorphic.
Cite
CITATION STYLE
APA
Allender, E. W. (1986). Isomorphisms and 1-L reductions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 223 LNCS, pp. 12–22). Springer Verlag. https://doi.org/10.1007/3-540-16486-3_86
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free