On the p-isomorphism conjecture

DOI10.1016/0304-3975(91)90284-9MaRDI QIDQ758202zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Recommendations

• One-way functions and the isomorphism conjecture
• The isomorphism conjecture for NP
• On the isomorphism conjecture for weak reducibilities
• On one-way functions and polynomial-time isomorphisms
• Productive functions and isomorphisms

Cites work

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

Cited in

(8)

• On the isomorphism conjecture for weak reducibilities
• scientific article; zbMATH DE number 4163510 (Why is no real title available?)
• Productive functions and isomorphisms
• One-way functions and the isomorphism conjecture
• The isomorphism conjecture for NP
• On one-one polynomial time equivalence relations
• scientific article; zbMATH DE number 4154424 (Why is no real title available?)
• scientific article; zbMATH DE number 4073256 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q758202)