On the p-isomorphism conjecture

DOI10.1016/0304-3975(91)90284-9zbMath0724.68041OpenAlexW2039055384WikidataQ123234527 ScholiaQ123234527MaRDI QIDQ758202

Osamu Watanabe

Publication date: 1991

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(91)90284-9

zbMATH Keywords

complete setsp-isomorphism conjecture

Mathematics Subject Classification ID

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

Related Items (1)

One-way functions and the isomorphism conjecture

Cites Work

• On one-one polynomial time equivalence relations
• Reductions among polynomial isomorphism types
• Some remarks on witness functions for nonpolynomial and noncomplete sets in NP
• On Isomorphisms and Density of $NP$ and Other Complete Sets

This page was built for publication: On the p-isomorphism conjecture