 |
|
Arpe, J. and Manthey, B.
(2009)
Approximability of Minimum AND-Circuits.
Algorithmica, 53 (3).
.
ISSN 0178-4617
*** ISI Impact 0,917 ***
Full text available as: Official URL: http://dx.doi.org/10.1007/s00453-007-9039-0  AbstractGiven a set of monomials, the  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  , 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  , 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 discuss generalizations of the problem and relations to addition chains and grammar-based compression.
| Item Type: | Article |
|---|
| Research Group: | EWI-DMMP: Discrete Mathematics and Mathematical Programming |
|---|
| Research Program: | CTIT-IE&ICT: Industrial Engineering and ICT |
|---|
| ID Code: | 16094 |
|---|
| Status: | Published |
|---|
| Deposited On: | 05 October 2009 |
|---|
| Refereed: | Yes |
|---|
| International: | Yes |
|---|
| ISI Impact Factor: | 0,917 |
|---|
| More Information: | statisticsmetis |
|---|
Export this item as: To request a copy of the PDF please email us request copy To correct this item please ask your editor Repository Staff Only: edit this item
|
|
|
Nederlands
Contact
Sitemap
Search
Organisation