Approximability of Minimum AND-Circuits

Given a set of monomials, the Minimum AND-Circuit problem asks for a circuit that computes these monomials using AND-gates of fan-in two and being of minimum size. We prove that the problem is not polynomial time

• Type: Conference
• Year: 2006
• Where: DAGSTUHL
• Authors: Jan Arpe, Bodo Manthey
• Keywords: DAGSTUHL 2006, DAGSTUHL 2007, Minimum AND-Circuit Problem, Minimum Size, Polynomial Time