Sciweavers

IPL
2011
112views more  IPL 2011»
13 years 2 months ago
Improved approximation algorithms for minimum AND-circuits problem via k-set cover
Arpe and Manthey [Algorithmica’09] recently studied the minimum ANDcircuit problem, which is a circuit minimization problem, and showed some results including approximation algo...
Hiroki Morizumi
DAGSTUHL
2006
13 years 8 months ago
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 t...
Jan Arpe, Bodo Manthey