LIPIcs.STACS.2015.21.pdf
- Filesize: 0.66 MB
- 13 pages
Document
The Minimum Oracle Circuit Size Problem
Authors
-
Part of:
Volume:
32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Symposium on Theoretical Aspects of Computer Science (STACS) - License:
Creative Commons Attribution 3.0 Unported license
- Publication date: 2015-02-26
Cite AsGet BibTex
Eric Allender, Dhiraj Holden, and Valentine Kabanets. The Minimum Oracle Circuit Size Problem. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 21-33, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
https://doi.org/10.4230/LIPIcs.STACS.2015.21
https://doi.org/10.4230/LIPIcs.STACS.2015.21
Abstract
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 MCSP^QBF
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 TC under uniform AC^0 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.
Keywords
- Kolmogorov complexity
- minimum circuit size problem
- PSPACE
- NP-intermediate sets
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads