Approximability of Minimum AND-Circuits

13 years 5 months ago

Download www.stat.berkeley.edu

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

Jan Arpe, Bodo Manthey

Real-time Traffic

DAGSTUHL 2006 | DAGSTUHL 2007 | Minimum AND-Circuit Problem | Minimum Size | Polynomial Time |

claim paper

» Improved approximation algorithms for minimum ANDcircuits problem via kset cover

» A 3Approximation for the Minimum Tree Spanning k Vertices

» A Simple Streaming Algorithm for Minimum Enclosing Balls

» Error Approximation and Minimum Phone Error Acoustic Model Estimation

» On Approximating Minimum Vertex Cover for Graphs with Perfect Matching

» Minimum Dominating Set Approximation in Graphs of Bounded Arboricity

» Polynomial time approximation schemes for minimum disk cover problems

» A Simple 3Approximation of Minimum Manhattan Networks

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2006
Where	DAGSTUHL
Authors	Jan Arpe, Bodo Manthey

Comments (0)

Sciweavers

Approximability of Minimum AND-Circuits

DAGSTUHL 2006 | DAGSTUHL 2007 | Minimum AND-Circuit Problem | Minimum Size | Polynomial Time |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers