On the isomorphism conjecture for weak reducibilities

DOI10.1006/jcss.1996.0068zbMath0859.68035OpenAlexW2085477325WikidataQ122928401 ScholiaQ122928401MaRDI QIDQ1816734

Manindra Agrawal

Publication date: 31 March 1997

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1996.0068

zbMATH Keywords

isomorphism conjectureNP-complete sets

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (4)

DSPACE(\(n\)) \(\overset {?} =\) NSPACE(\(n\)): A degree theoretic characterization ⋮ The isomorphism conjecture for constant depth reductions ⋮ Investigations Concerning the Structure of Complete Sets ⋮ Reductions in circuit complexity: An isomorphism theorem and a gap theorem

This page was built for publication: On the isomorphism conjecture for weak reducibilities