Approximability of Minimum AND-Circuits

Authors Jan Arpe, Bodo Manthey

Thumbnail PDF


  • Filesize: 330 kB
  • 21 pages

Document Identifiers

Author Details

Jan Arpe
Bodo Manthey

Cite AsGet BibTex

Jan Arpe and Bodo Manthey. Approximability of Minimum AND-Circuits. In Complexity of Boolean Functions. Dagstuhl Seminar Proceedings, Volume 6111, pp. 1-21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)


Given a set of monomials, the {sc 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 approximable within a factor of less than $1.0051$ unless $mathsf{P} = mathsf{NP}$, even if the monomials are restricted to be of degree at most three. For the latter case, we devise several efficient approximation algorithms, yielding an approximation ratio of $1.278$. For the general problem, we achieve an approximation ratio of $d-3/2$, where $d$ is the degree of the largest monomial. In addition, we prove that the problem is fixed parameter tractable with the number of monomials as parameter. Finally, we reveal connections between the {sc Minimum AND-Circuit} problem and several problems from different areas.
  • Optimization problems
  • approximability
  • automated circuit design


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail