Download:
|
by Stephen A. Fenner, Lance Fortnow, Ashish V. Naik, John D. Rogers
ftp://ftp.cs.uchicago.edu/pub/publications/tech-reports/TR-95-05.ps
Add To MetaCart
Abstract:
One of the principle challenges in complexity theory is to understand the power of nondeterminism. One-way functions are an important tool for studying nondeterministic functions. A polynomial-time computable function f is one-way if it is one-to-one, honest, and cannot
Citations
|
833
|
Reducibility among Combinatorial Problems
– Karp
- 1972
|
|
496
|
The complexity of theorem-proving procedures
– Cook
- 1971
|
|
474
|
A pseudorandom generator from any one-way function
– stad, Impagliazzo, et al.
- 1999
|
|
231
|
Trading group theory for randomness
– Babai
- 1985
|
|
135
|
Complexity measures for public-key cryptosystems
– Grollman, Selman
- 1988
|
|
91
|
A taxonomy on complexity classes of functions
– Selman
- 1994
|
|
80
|
The complexity of promise problems with applications to public-key cryptography
– Even, Selman, et al.
- 1984
|
|
77
|
Quantitative relativizations of complexity classes
– Book, Long, et al.
- 1984
|
|
44
|
Decision Trees and Downward Closures
– Impagliazzo, Naor
- 1988
|
|
42
|
The isomorphism conjecture fails relative to a random oracle
– Kurtz, Mahaney, et al.
- 1989
|
|
32
|
The isomorphism conjecture holds relative to an oracle
– Fenner, Fortnow, et al.
- 1992
|
|
30
|
Separability and one-way functions
– Fortnow, Rogers
- 1994
|
|
24
|
Some Comments on Functional Self-Reducibility and the NP Hierarchy
– Borodin, Demers
- 1976
|
|
20
|
Universal sorting problems. Problems of information transmission
– Levin
- 1973
|
|
14
|
Sperner’s lemma and robust machines
– Crescenzi, Silvestri
- 1998
|
|
7
|
Computing unique solutions collapses the polynomial hierarchy
– Hemaspaandra, Naik, et al.
- 1994
|
|
3
|
Easy sets and hard certi��cate schemes
– Hemaspaandra, Rothe, et al.
- 1995
|
