One-way functions and the isomorphism conjecture

DOI10.1016/0304-3975(94)90031-0zbMath0822.68032OpenAlexW2032145627WikidataQ123301429 ScholiaQ123301429MaRDI QIDQ1329733

V. Pereyra

Publication date: 9 October 1995

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

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90031-0

zbMATH Keywords

isomorphism conjecture

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the p-isomorphism conjecture
• On one-one polynomial time equivalence relations
• Some remarks on witness functions for nonpolynomial and noncomplete sets in NP
• On one-way functions and polynomial-time isomorphisms
• Collapsing degrees
• On p-creative sets and p-completely creative sets
• Complete Problems and Strong Polynomial Reducibilities
• On Isomorphisms and Density of $NP$ and Other Complete Sets

This page was built for publication: One-way functions and the isomorphism conjecture