Separability and one-way functions

Authors:
Lance Fortnow;John D. Rogers
Affiliations:
Computer Science Department, University of Chicago, Chicago, IL;School of CTI, DePaul University, Chicago, IL
Venue:
Computational Complexity
Year:
2003

Citing 16
Cited 5

Relativizations of unambiguous and random polynomial time classes

SIAM Journal on Computing
Theory of recursive functions and effective computability

Theory of recursive functions and effective computability
Complexity measures for public-key cryptosystems

SIAM Journal on Computing - Special issue on cryptography
Limits on the provable consequences of one-way permutations

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
One-way functions and the nonisomorphism of NP-complete sets

Theoretical Computer Science
Oracles for structural properties: the isomorphism problem and public-key cryptography

Journal of Computer and System Sciences
Gap-definable counting classes

Journal of Computer and System Sciences
The isomorphism conjecture fails relative to a random oracle

Journal of the ACM (JACM)
Isomorphisms, separability, and one-way functions

Isomorphisms, separability, and one-way functions
A general method to construct oracles realizing given relationships between complexity classes

Theoretical Computer Science - Special issue on complexity theory and the theory of algorithms as developed in the CIS
Sperner's lemma and robust machines

Computational Complexity
Relativized Questions Involving Probabilistic Algorithms

Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
An oracle builder's toolkit

Information and Computation
Some Comments on Functional Self-Reducibility and the NP Hierarchy

Some Comments on Functional Self-Reducibility and the NP Hierarchy
Inverting onto functions

Information and Computation

The complexity of unions of disjoint sets

Journal of Computer and System Sciences
Nondeterministic functions and the existence of optimal proof systems

Theoretical Computer Science
The complexity of unions of disjoint sets

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
The shrinking property for NP and coNP

Theoretical Computer Science
Inverting onto functions and polynomial hierarchy

CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We settle all relativized questions of the relationships between the following five propositions: • P=NP. • P=UP. • P=NP ∩ coNP. • All disjoint pairs of NP sets are P-separable. • All disjoint pairs of coNP sets are P-separable. We make the first widespread use of variations of generic oracles to achieve the necessary relativized worlds.