Advertisement

Approximability of Minimum AND-Circuits

  • Jan Arpe
  • Bodo Manthey
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4059)

Abstract

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.

Keywords

Approximation Ratio Vertex Cover Input Instance Addition Chain Input Gate 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)Google Scholar
  2. 2.
    Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Heidelberg (1999)zbMATHGoogle Scholar
  3. 3.
    Charikar, M., Lehman, E., Liu, D., Panigrahy, R., Prabhakaran, M., Sahai, A., Shelat, A.: The smallest grammar problem. IEEE Transactions on Information Theory 51(7), 2554–2576 (2005)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Chlebík, M., Chlebíková, J.: Complexity of approximating bounded variants of optimization problems. Theoretical Computer Science 354(3), 320–338 (2006)CrossRefMathSciNetzbMATHGoogle Scholar
  5. 5.
    Downey, P.J., Leong, B.L., Sethi, R.: Computing sequences with addition chains. SIAM Journal on Computing 10(3), 638–646 (1981)CrossRefMathSciNetzbMATHGoogle Scholar
  6. 6.
    Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, Heidelberg (1999)Google Scholar
  7. 7.
    Kabanets, V., Cai, J.-Y.: Circuit minimization problems. In: Proc. of the 32nd Ann. ACM Symp. on Theory of Computing (STOC), pp. 73–79. ACM Press, New York (2000)Google Scholar
  8. 8.
    Kieffer, J.C., Yang, E.-h.: Grammar based codes: A new class of universal lossless source codes. IEEE Transactions on Information Theory 46(3), 737–754 (2000)CrossRefMathSciNetzbMATHGoogle Scholar
  9. 9.
    Knuth, D.E.: Seminumerical Algorithms, 2nd edn. The Art of Computer Programming, vol. 2. Addison-Wesley, Reading (1981)zbMATHGoogle Scholar
  10. 10.
    Storer, J.A., Szymanski, T.G.: The macro model for data compression. In: Proc. of the 10th Ann. ACM Symp. on Theory of Computing (STOC), pp. 30–39. ACM Press, New York (1978)CrossRefGoogle Scholar
  11. 11.
    Tarjan, R.E.: Complexity of monotone networks for computing conjunctions. Annals of Discrete Mathematics 2, 121–133 (1978)CrossRefMathSciNetzbMATHGoogle Scholar
  12. 12.
    Thurber, E.G.: Efficient generation of minimal length addition chains. SIAM Journal on Computing 28(4), 1247–1263 (1999)CrossRefMathSciNetzbMATHGoogle Scholar
  13. 13.
    Wegener, I.: The Complexity of Boolean Functions. Wiley-Teubner, Chichester (1987)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jan Arpe
    • 1
  • Bodo Manthey
    • 2
  1. 1.Institut für Theoretische InformatikUniversität zu LübeckLübeckGermany
  2. 2.InformatikUniversität des SaarlandesSaarbrückenGermany

Personalised recommendations