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 approximable within a factor of less than 1.0051 unless P = 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 Minimum AND-Circuit problem and several problems from different areas

[1]  James A. Storer,et al.  The macro model for data compression (Extended Abstract) , 1978, STOC '78.

[2]  Viggo Kann,et al.  Some APX-completeness results for cubic graphs , 2000, Theor. Comput. Sci..

[3]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[4]  Edward G. Thurber.  Efficient Generation of Minimal Length Addition Chains , 1999, SIAM J. Comput..

[5]  R. Tarjan.  Complexity of monotone networks for computing conjunctions , 1976 .

[6]  G. Nemhauser,et al.  Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms , 1977 .

[7]  Bodo Manthey,et al.  Approximability of Minimum AND-Circuits , 2006, Algorithmica.

[8]  Christopher Umans.  The Minimum Equivalent DNF Problem and Shortest Implicants , 2001, J. Comput. Syst. Sci..

[9]  Miroslav Chlebík,et al.  Complexity of approximating bounded variants of optimization problems , 2006, Theor. Comput. Sci..

[10]  En-Hui Yang,et al.  Grammar-based codes: A new class of universal lossless source codes , 2000, IEEE Trans. Inf. Theory.

[11]  Ingo Wegener,et al.  The complexity of Boolean functions , 1987 .

[12]  Giorgio Gambosi,et al.  Complexity and Approximation , 1999, Springer Berlin Heidelberg.

[13]  Giorgio Gambosi,et al.  Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .

[14]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[15]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[16]  Jin-Yi Cai,et al.  Circuit minimization problem , 2000, STOC '00.

[17]  Abhi Shelat,et al.  The smallest grammar problem , 2005, IEEE Transactions on Information Theory.

[18]  Lisa Hellerstein,et al.  Minimizing DNF Formulas and AC0 Circuits Given a Truth Table , 2005, Electron. Colloquium Comput. Complex..

[19]  Peter J. Downey,et al.  Computing Sequences with Addition Chains , 1981, SIAM J. Comput..

[20]  George L. Nemhauser,et al.  Note--On "Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms" , 1979 .

[21]  V. Feldman.  Hardness of approximate two-level logic minimization and PAC learning with membership queries , 2006, STOC 2006.

[22]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .