Cai and Selman [CS99] defined a modification of Levin's notion of average polynomial time and proved, for every P-bi-immune language L and every polynomial-time computable distribution with infinite support, that L is not recognizable in polynomial time on the-average. We call such languages distributionally-hard. Pavan and Selman [PS00] proved that there exist distributionally-hard sets that are not P-biimmune if and only P contains P-printable-immune sets. We extend this characterizion to include assertions about several traditional questions about immunity, about finding witnesses for NP-machines, and about existence of one-way functions. Similarly, we address the question of whether NP contains sets that are distributionally hard. Several of our results are implications for which we cannot prove whether or not their converse holds. In nearly all such cases we provide oracles relative to which the converse fails. We use the techniques of Kolmogorov complexity to describe our oracles and to simplify the technical arguments. 1
|
1083
|
Introduction to Kolmogorov Complexity and Its Applications
– Li, Vitanyi
- 1993
|
|
192
|
Almost optimal lower bounds for small depth circuits
– H˚astad
- 1986
|
|
159
|
Almost everywhere high nonuniform complexity
– Lutz
- 1992
|
|
157
|
Separating the polynomial-time hierarchy by oracles
– Yao
- 1985
|
|
153
|
Average case complete problems
– Levin
- 1986
|
|
86
|
The quantitative structure of exponential time
– Lutz
- 1997
|
|
69
|
Average case completeness
– Gurevich
- 1991
|
|
55
|
Almost every set in exponential time is P-bi-immune
– Mayordomo
- 1994
|
|
51
|
P-printable sets
– Allender, Rubinstein
- 1988
|
|
51
|
Sparse sets
– Hartmanis, Immerman, et al.
- 1985
|
|
50
|
Tally languages and complexity classes
– Book
- 1974
|
|
50
|
Cook versus Karp-Levin: Separating completeness notions if NP is not small
– Lutz, Mayordomo
- 1996
|
|
45
|
On self-reducibility and weak P-selectivity
– Ko
- 1983
|
|
43
|
A personal view of average-case complexity
– Impagliazzo
- 1995
|
|
41
|
Bi-immune sets for complexity classes
– Balc'azar, Schoning
- 1985
|
|
39
|
Resource-bounded measure and randomness
– Ambos-Spies, Mayordomo
- 1997
|
|
35
|
Resource bounded randomness and weakly complete problems. Theoretical Computer Science
– Ambos-Spies, Terwijn, et al.
- 1997
|
|
33
|
e Paul Vitányi, An Introduction to Kolmogorov Complexity and its Applications, Springer-Verlag Graduate Texts
– Li
|
|
32
|
Average-case computational complexity theory
– Wang
- 1997
|
|
28
|
Computation times of NP sets of different densities
– Hartmanis, Yesha
- 1984
|
|
27
|
Computational complexity of real functions
– Ko, Friedman
- 1982
|
|
26
|
Defying upward and downward separation
– Hemaspaandra, Jha
- 1995
|
|
21
|
The polynomial-time hierarchy and sparse oracles
– Balc'azar, Book, et al.
- 1986
|
|
20
|
A survey of one-way functions in complexity theory
– Selman
- 1992
|
|
19
|
Relative to a random oracle, NP is not small
– Kautz, Miltersen
- 1994
|
|
15
|
Fine separation of average time complexity classes
– Cai, Selman
- 1996
|
|
13
|
Easy sets and hard certificate schemes
– Hemaspaandra, Rothe, et al.
- 1997
|
|
11
|
Relativizing complexity classes with sparse oracles
– Long, Selman
- 1986
|
|
9
|
Relativized worlds with an infinite hierarchy
– Fortnow
- 1999
|
|
9
|
Sets computable in polynomial time on average
– Schuler, Yamakami
- 1995
|
|
8
|
Orders of Infinity, The `infinit arcalc ul' of Paul du Bois-Reymond, volume 12 of Cambridge Tracts
– Hardy
- 1924
|
|
6
|
Almost optimal lower bounds for small depth circuits
– astad
- 1989
|
|
6
|
Weak completeness in
– Juedes, Lutz
- 1995
|
|
5
|
azar and U. Sch oning. Bi-immune sets for complexity classes
– Balc
- 1985
|
|
5
|
Complete distributional problems, hard languages, and resource-bounded measure
– Pavan, Selman
- 2000
|
|
4
|
Sparse sets in NP\GammaP: EXPTIME versus NEXPTIME
– Hartmanis, Immerman, et al.
- 1985
|
|
3
|
Search versus decision in super-polynomial time
– Impagliazzo, Tardos
- 1991
|
|
3
|
Tally languages and complexity classes. Information and Control, 26:186--193
– Book
- 1974
|
|
1
|
Cook vs. Karp-Levin: Separating completeness notions if NP is not small
– Lutz, Mayordomo
- 1996
|
|
