The minimum oracle circuit size problem

We consider variants of the Minimum Circuit Size Problem MCSP, where the goal is to minimize the size of oracle circuits computing a given function. When the oracle is QBF, the resulting problem MCSPQBF is known to be complete for PSPACE under ZPP reductions. We show that it is not complete under logspace reductions, and indeed it is not even hard for TC0 under uniform AC0 reductions. We obtain a variety of consequences that follow if oracle versions of MCSP are hard for various complexity classes under different types of reductions. We also prove analogous results for the problem of determining the resource-bounded Kolmogorov complexity of strings, for certain types of Kolmogorov complexity measures.The earlier conference paper version of this article is available from http://dx.doi.org/10.7282/T3Z60QVR and from the Dagstuhl Research Online Publication Server at http://dx.doi.org/10.4230/LIPIcs.STACS.2015.21.Peer reviewed