Almost everywhere high nonuniform complexity

Investigates the distribution of nonuniform complexities in uniform complexity classes. The author proves that almost every problem decidable in exponential space has essentially maximum circuit-size and program-size complexity almost everywhere. In exponential-time complexity classes, he proves that the strongest relativizable lower bounds hold almost everywhere for almost all problems. He shows that infinite pseudorandom sequences have high nonuniform complexity almost everywhere. The results are unified by a refined formulation of the underlying measure theory and by the introduction of a new nonuniform complexity measure, the selective program-size complexity.<<ETX>>

[1]  Ker-I Ko,et al.  On the Notion of Infinite Pseudorandom Sequences , 1986, Theor. Comput. Sci..

[2]  P. Martin-Löf.  Complexity oscillations in infinite binary sequences , 1971 .

[3]  Per Martin-Löf,et al.  The Definition of Random Sequences , 1966, Inf. Control..

[4]  Robert E. Wilber.  Randomness and the density of hard problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[5]  Silvio Micali,et al.  How to construct random functions , 1986, JACM.

[6]  A. Kolmogorov,et al.  ALGORITHMS AND RANDOMNESS , 1988 .

[7]  Claude E. Shannon,et al.  The synthesis of two-terminal switching circuits , 1949, Bell Syst. Tech. J..

[8]  R. I. Freidzon.  Families of recursive predicates of measure zero , 1976 .

[9]  Manuel Blum,et al.  How to generate cryptographically strong sequences of pseudo random bits , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[10]  A. Kolmogorov.  Three approaches to the quantitative definition of information , 1968 .

[11]  Richard J. Lipton,et al.  Some connections between nonuniform and uniform complexity classes , 1980, STOC '80.

[12]  Yaser S. Abu-Mostafa,et al.  Random problems , 1988, J. Complex..

[13]  Yaser S. Abu-Mostafa.  The complexity of information extraction , 1986, IEEE Trans. Inf. Theory.

[14]  Jack H. Lutz.  Resource bounded baire category and small circuits in exponential space , 1987, Computational Complexity Conference.

[15]  Leonid A. Levin,et al.  One way functions and pseudorandom generators , 1987, Comb..

[16]  Jack H. Lutz,et al.  Category and Measure in Complexity Classes , 1990, SIAM J. Comput..

[17]  Andrew Chi-Chih Yao,et al.  Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[18]  J. C. Oxtoby.  Measure and Category , 1971 .

[19]  Gregory J. Chaitin,et al.  On the Length of Programs for Computing Finite Binary Sequences , 1966, JACM.

[20]  Jack H. Lutz.  Pseudorandom sources for BPP , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

[21]  Ray J. Solomonoff,et al.  A Formal Theory of Inductive Inference. Part II , 1964, Inf. Control..

[22]  Ravi Kannan,et al.  Circuit-Size Lower Bounds and Non-Reducibility to Sparse Sets , 1982, Inf. Control..

[23]  Ming Li,et al.  Two decades of applied Kolmogorov complexity: in memoriam Andrei Nikolaevich Kolmogorov 1903-87 , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

[24]  Dung T. Huynh,et al.  Resource- Bounded Kolmogorov Complexity of Hard Languages , 1986, SCT.

[25]  J. Hartmanis,et al.  Computation Times of NP Sets of Different Densities , 1984, Theor. Comput. Sci..

[26]  Michael Sipser,et al.  A complexity theoretic approach to randomness , 1983, STOC.

[27]  Juris Hartmanis,et al.  Generalized Kolmogorov complexity and the structure of feasible computations , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[28]  Christopher B. Wilson.  Relativized circuit complexity , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[29]  Dung T. Huynh.  Some Observations about the Randomness of Hard Problems , 1986, SIAM J. Comput..

[30]  Osamu Watanabe,et al.  Kolmogorov complexity and degrees of tally sets , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

[31]  Kurt Mehlhorn.  On the Size of Sets of Computable Functions , 1973, SWAT.

[32]  Eric Allender.  Some consequences of the existence of pseudorandom generators , 1987, STOC '87.

[33]  Kurt Mehlhorn.  The "Almost All" Theory of Subrecursive Degrees is Decidable , 1974, ICALP.