Separability and one-way functions

DOI10.1007/s00037-002-0173-4zbMath1137.68407OpenAlexW2054160479MaRDI QIDQ1430571

John D. Rogers, Lance J. Fortnow

Publication date: 27 May 2004

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00037-002-0173-4

Mathematics Subject Classification ID

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

Related Items (5)

Nondeterministic functions and the existence of optimal proof systems ⋮ The shrinking property for NP and coNP ⋮ The complexity of unions of disjoint sets ⋮ Inseparability and strong hypotheses for disjoint NP pairs ⋮ Does the polynomial hierarchy collapse if onto functions are invertible?

This page was built for publication: Separability and one-way functions