Ming Li Paul Vitányi Fourth Edition Page 1 An Introduction to Kolmogorov Complexity and Its
Applications Ming Li Paul Vitányi Fourth Edition Texts in Computer Science Page 2 Texts in …

We show that sets consisting of strings of high Kolmogorov complexity provide examples of
sets that are complete for several complexity classes under probabilistic and nonuniform …

Hardness of computing the Kolmogorov complexity of a given string is closely tied to a
security proof of hitting set generators, and thus understanding hardness of Kolmogorov …

Relational problems (those with many possible valid outputs) are different from decision
problems, but it is easy to forget just how different. This paper initiates the study of …

Abstract The Minimum Circuit Size Problem (MCSP) asks whether a given Boolean function
has a circuit of at most a given size. MCSP has been studied for over a half-century and has …

This paper has the following goals: To survey some of the recent developments in the field of
derandomization. To introduce a new notion of time-bounded Kolmogorov complexity (KT) …

Relativization is one of the most fundamental concepts in complexity theory, which explains
the difficulty of resolving major open problems. In this paper, we propose a weaker notion of …

A recursive enumerator for a function h is an algorithm f which enumerates for an input x
finitely many elements including h (x). f is ak (n)-enumerator if for every input x of length n. h …

We show that sets consisting of strings of high Kolmogorov complexity provide examples of
sets that are complete for several complexity classes under probabilistic and non-uniform …

Synergy Between Circuit Obfuscation and Circuit Minimization Page 1 Synergy Between Circuit
Obfuscation and Circuit Minimization Russell Impagliazzo Department of Computer Science …