Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



TR18-030 | 9th February 2018 18:29

NP-hardness of Minimum Circuit Size Problem for OR-AND-MOD Circuits


Authors: Shuichi Hirahara, Igor Carboni Oliveira, Rahul Santhanam
Publication: 11th February 2018 13:52
Downloads: 4682


The Minimum Circuit Size Problem (MCSP) asks for the size of the smallest boolean circuit that computes a given truth table. It is a prominent problem in NP that is believed to be hard, but for which no proof of NP-hardness has been found. A significant number of works have demonstrated the central role of this problem and its variations in diverse areas such as cryptography, derandomization, proof complexity, learning theory, and circuit lower bounds.

The NP-hardness of computing the minimum numbers of terms in a DNF formula consistent with a given truth table was proved by W. Masek in 1979. In this work, we make the first progress in showing NP-hardness for more expressive classes of circuits, and establish an analogous result for the MCSP problem for depth-$3$ circuits of the form OR-AND-MOD$_2$. Our techniques extend to an NP-hardness result for MOD$_m$ gates at the bottom layer under inputs from $(\mathbb Z / m \mathbb Z)^n$.

ISSN 1433-8092 | Imprint