Minimizing DNF Formulas and AC^0_d Circuits Given a Truth Table

Authors:
Eric Allender;Lisa Hellerstein;Paul McCabe;Toniann Pitassi;Michael Saks
Affiliations:
Rutgers University, USA;Polytechnic University, USA;University of Toronto, Canada;University of Toronto, Canada;Rutgers University, USA
Venue:
CCC '06 Proceedings of the 21st Annual IEEE Conference on Computational Complexity
Year:
2006

Citing 0
Cited 4

Hardness of approximate two-level logic minimization and PAC learning with membership queries

Journal of Computer and System Sciences
Boolean functions with a simple certificate for CNF complexity

Discrete Applied Mathematics
Towards efficient implementation of packet classifiers in SDN/OpenFlow

Proceedings of the second ACM SIGCOMM workshop on Hot topics in software defined networking
Boolean functions with long prime implicants

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

For circuit classes R, the fundamental computational problem Min-R asks for the minimum R-size of a Boolean function presented as a truth table. Prominent examples of this problem include Min-DNF, which asks whether a given Boolean function presented as a truth table has a k-term DNF, and Min-Circuit (also called MCSP), which asks whether a Boolean function presented as a truth table has a size k Boolean circuit. We present a new reduction proving that Min-DNF is NP-complete. It is significantly simpler than the known reduction of Masek [31], which is from Circuit-SAT.