Vaughan Jones, Kolmogorov Complexity, and the New Complexity Landscape around Circuit Minimization

Abstract

We survey recent developments related to the Minimum Circuit Size Problem and time-bounded Kolmogorov Complexity.

A Duality between One-Way Functions and Average-Case Symmetry of Information

“…One of the proofs discussed in Section 1.3 relies on techniques from meta-complexity, a rapidly developing area which investigates the complexity of computational problems and tasks that are themselves about computations and their complexity. We refer to the surveys [All21,Hir22a] for an overview of recent results in this area.…”