On the p-isomorphism conjecture

DOI10.1016/0304-3975(91)90284-9zbMATH Open0724.68041OpenAlexW2039055384WikidataQ123234527 ScholiaQ123234527MaRDI QIDQ758202FDOQ758202

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

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

zbMATH Keywords

complete setsp-isomorphism conjecture

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (8)

• On one-one polynomial time equivalence relations
• Title not available (Why is that?)
• The isomorphism conjecture for NP
• Productive functions and isomorphisms
• One-way functions and the isomorphism conjecture
• Title not available (Why is that?)
• On the isomorphism conjecture for weak reducibilities
• Title not available (Why is that?)

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)