Document Open Access Logo

The Minimum Oracle Circuit Size Problem

Authors Eric Allender, Dhiraj Holden, Valentine Kabanets

PDF
Thumbnail PDF

File

LIPIcs.STACS.2015.21.pdf
  • Filesize: 0.66 MB
  • 13 pages

Document Identifiers

Author Details

Eric Allender
Dhiraj Holden
Valentine Kabanets

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

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)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. Manindra Agrawal. The isomorphism conjecture for constant depth reductions. Journal of Computer and System Sciences, 77(1):3-13, 2011. Google Scholar
  2. Manindra Agrawal. Personal Communication, 2014. Google Scholar
  3. Eric Allender, Harry Buhrman, Michal Kouckỳ, Dieter van Melkebeek, and Detlef Ronneburger. Power from random strings. SIAM Journal on Computing, 35(6):1467-1493, 2006. Google Scholar
  4. Eric Allender and Bireswar Das. Zero knowledge and circuit minimization. In Mathematical Foundations of Computer Science (MFCS), volume 8635 of Lecture Notes in Computer Science, pages 25-32. Springer, 2014. Google Scholar
  5. Eric Allender and Vivek Gore. On strong separations from AC⁰. In Jin-Yi Cai, editor, Advances in Computational Complexity Theory, volume 13 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 21-37. AMS Press, 1993. Google Scholar
  6. Eric Allender, Michal Koucký, Detlef Ronneburger, and Sambuddha Roy. The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory. Journal of Computer and System Sciences, 77:14-40, 2010. Google Scholar
  7. José L Balcázar, Antoni Lozano, and Jacobo Torán. The complexity of algorithmic problems on succinct instances. In Computer Science, pages 351-377. Springer, 1992. Google Scholar
  8. Stephen A. Fenner, Lance Fortnow, and Stuart A. Kurtz. Gap-definable counting classes. Journal of Computer and System Sciences, 48(1):116-148, 1994. Google Scholar
  9. Hana Galperin and Avi Wigderson. Succinct representations of graphs. Information and Control, 56(3):183-198, 1983. Google Scholar
  10. Johan Håstad. Almost optimal lower bounds for small depth circuits. In Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, pages 6-20, 1986. Google Scholar
  11. Valentine Kabanets and Jin-Yi Cai. Circuit minimization problem. In Proceedings of the thirty-second annual ACM symposium on Theory of computing, pages 73-79. ACM, 2000. Google Scholar
  12. Leonid Levin. Randomness conservation inequalities; information and independence in mathematical theories. Information and Control, 61:15-37, 1984. Google Scholar
  13. Cody Murray and Ryan Williams. On the (non) NP-hardness of computing circuit complexity. In Electronic Colloquium on Computational Complexity (ECCC), 2014. TR14-164. Google Scholar
  14. Tatsuaki Okamoto. On relationships between statistical zero-knowledge proofs. Journal of Computer and System Sciences, 60(1):47-108, 2000. Google Scholar
  15. Christos H. Papadimitriou. Computational complexity. John Wiley and Sons Ltd., 2003. Google Scholar
  16. Christos H. Papadimitriou and Mihalis Yannakakis. A note on succinct representations of graphs. Information and Control, 71(3):181-185, 1986. Google Scholar
  17. Boris A. Trakhtenbrot. A survey of Russian approaches to perebor (brute-force searches) algorithms. IEEE Annals of the History of Computing, 6(4):384-400, 1984. Google Scholar
  18. Klaus W Wagner. The complexity of combinatorial problems with succinct input representation. Acta Informatica, 23(3):325-356, 1986. Google Scholar
  19. Ryan Williams. http://cstheory.stackexchange.com/questions/10320/succinct-problems-in-mathsfp/10546#10546, 2012. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact