article

Separability and one-way functions

Authors:

John D. RogersAuthors Info & Claims

Computational Complexity, Volume 11, Issue 3/4

Pages 137 - 157

https://doi.org/10.1007/s00037-002-0173-4

Published: 01 March 2003 Publication History

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.

References

[1]

T. BAKER, J. GILL & R. SOLOVAY (1975). Relativizations of the P = NP question. SIAM J. Comput.4, 431-442.

[2]

C. BENNETT & J. GILL (1981). Relative to a random oracle, PA≠≠ NPA≠ co-NPA with probability one. SIAM J. Comput.10, 96-113.

[3]

M. BLUM & R. IMPAGLIAZZO (1987). Generic oracles and oracle classes. In Proc. 28th IEEE Symposium on Foundations of Computer Science, IEEE, New York, 118-126.

[4]

A. BORODIN & A. DEMERS (1976). Some comments on functional self-reducibility and the NP hierarchy. Technical Report TR76-284, Cornell University.

[5]

P. CRESCENZI & R. SILVESTRI (1998). Sperner's lemma and robust machines. Comput. Complexity7, 163-173.

[6]

S. FENNER, L. FORTNOW & S. KURTZ (1994). Gap-definable counting classes. J. Comput. System Sci.48, 116-148.

Digital Library

[7]

S. FENNER, L. FORTNOW, S. KURTZ & L. LI (2003a). An oracle builder's toolkit. Inform. and Comput.182, 95-136.

Digital Library

[8]

S. FENNER, L. FORTNOW, A. NAIK & J. ROGERS (2003b). Inverting onto functions. Inform. and Comput.186, 90-103.

Digital Library

[9]

J. GESKE & J. GROLLMANN (1986). Relativizations of unambiguous and random polynomial time classes. SIAM J. Comput.15, 511-519.

Digital Library

[10]

J. GROLLMANN & A SELMAN (1988). Complexity measures for public-key cryptosystems. SIAM J. Comput.17, 309-355.

Digital Library

[11]

J. HARTMANIS & L. HEMACHANDRA (1991). One-way functions and the nonisomorphism of NP-complete sets. Theoret. Comput. Sci.81, 155-163.

Digital Library

[12]

S. HOMER & A. SELMAN (1992). Oracles for structural properties: The isomorphism problem and public-key cryptography. J. Comput. System Sci.44, 287-301.

Digital Library

[13]

J. HOPCROFT & J. ULLMAN (1979). Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading, MA.

[14]

R. IMPAGLIAZZO & M. NAOR (1988). Decision trees and downward closures. In Proc. 3rd IEEE Structure in Complexity Theory Conference, IEEE, New York, 29-38.

[15]

R. IMPAGLIAZZO & S. RUDICH (1989). Limits on the provable consequences of one-way permutations. In Proc. 21st ACM Symposium on the Theory of Computing, ACM, New York, 44-61.

[16]

S. KURTZ, S. MAHANEY & J. ROYER (1995). The isomorphism conjecture fails relative to a random oracle. J. Assoc. Comput. Mach.42, 401-420.

Digital Library

[17]

K. MEHLHORN (1973). On the size of sets of computable functions. In Proc. 14th IEEE Symposium on Switching and Automata Theory, IEEE, New York, 190-196.

[18]

A. MUCHNIK & N. VERESHCHAGIN (1996). A general method to construct oracles realizing given relationships between complexity classes. Theoret. Comput. Sci.157, 227-258.

Digital Library

[19]

C. RACKOFF (1982). Relativized questions involving probablistic algorithms. J. Assoc. Comput. Mach.29, 261-268.

Digital Library

[20]

H. ROGERS (1987). Theory of Recursive Functions and Effective Computability. MIT Press, Cambridge, MA.

[21]

J. ROGERS (1995). Isomorphisms, separability, and one-way functions. Ph.D. thesis, Univ. of Chicago.

[22]

N. VERESHCHAGIN (1993). Relationships between NP-sets, co-NP-sets and P-sets relative to random oracles. In Proc. 8th IEEE Structure in Complexity Theory Conference, IEEE, New York, 132-138.

Cited By

Beyersdorff OKöbler JMessner J(2009)Nondeterministic functions and the existence of optimal proof systemsTheoretical Computer Science10.1016/j.tcs.2009.05.021410:38-40(3839-3855)Online publication date: 1-Sep-2009
https://dl.acm.org/doi/10.1016/j.tcs.2009.05.021
Glaßer CSelman ATravers SWagner K(2008)The complexity of unions of disjoint setsJournal of Computer and System Sciences10.1016/j.jcss.2008.05.00174:7(1173-1187)Online publication date: 1-Nov-2008
https://dl.acm.org/doi/10.1016/j.jcss.2008.05.001
Buhrman HFortnow LKoucký MRogers JVereshchagin N(2007)Inverting onto functions and polynomial hierarchyProceedings of the Second international conference on Computer Science: theory and applications10.5555/2391910.2391922(92-103)Online publication date: 3-Sep-2007
https://dl.acm.org/doi/10.5555/2391910.2391922
Show More Cited By

Index Terms

Separability and one-way functions
1. Theory of computation
  1. Computational complexity and cryptography
    1. Complexity classes
    2. Problems, reductions and completeness

Recommendations

Isomorphisms, separability, and one-way functions
An oracle builder's toolkit

We show how to use various notions of genericity as tools in oracle creation. In particular, 1. we give an abstract definition of genericity that encompasses a large collection of different generic notions; 2. we consider a new complexity class AWPP , ...
An axiomatic approach to algebrization
STOC '09: Proceedings of the forty-first annual ACM symposium on Theory of computing

Non-relativization of complexity issues can be interpreted as giving some evidence that these issues cannot be resolved by "black-box" techniques. In the early 1990's, a sequence of important non-relativizing results was proved, mainly using algebraic ...

Comments

Information & Contributors

Information

Published In

cover image Computational Complexity

Computational Complexity Volume 11, Issue 3/4

March 2003

80 pages

ISSN:1016-3328

Issue’s Table of Contents

Publisher

Birkhauser Verlag

Switzerland

Publication History

Published: 01 March 2003

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 28 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Beyersdorff OKöbler JMessner J(2009)Nondeterministic functions and the existence of optimal proof systemsTheoretical Computer Science10.1016/j.tcs.2009.05.021410:38-40(3839-3855)Online publication date: 1-Sep-2009
https://dl.acm.org/doi/10.1016/j.tcs.2009.05.021
Glaßer CSelman ATravers SWagner K(2008)The complexity of unions of disjoint setsJournal of Computer and System Sciences10.1016/j.jcss.2008.05.00174:7(1173-1187)Online publication date: 1-Nov-2008
https://dl.acm.org/doi/10.1016/j.jcss.2008.05.001
Buhrman HFortnow LKoucký MRogers JVereshchagin N(2007)Inverting onto functions and polynomial hierarchyProceedings of the Second international conference on Computer Science: theory and applications10.5555/2391910.2391922(92-103)Online publication date: 3-Sep-2007
https://dl.acm.org/doi/10.5555/2391910.2391922
Glaßer CSelman ATravers SWagner K(2007)The complexity of unions of disjoint setsProceedings of the 24th annual conference on Theoretical aspects of computer science10.5555/1763424.1763455(248-259)Online publication date: 22-Feb-2007
https://dl.acm.org/doi/10.5555/1763424.1763455

View Options

View options

Figures

Tables

Media

View Issue’s Table of Contents