Boolean functions with long prime implicants

DOI10.1016/j.ipl.2013.07.001zbMath1285.06006OpenAlexW2020701847WikidataQ62044322 ScholiaQ62044322MaRDI QIDQ2445231

Ondřej Čepek, Petr Kučera, Stanislav Kuřík

Publication date: 14 April 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2013.07.001

zbMATH Keywords

analysis of algorithmsapproximation algorithmsset coverBoolean minimizationDNFconsensus method

Mathematics Subject Classification ID

Uses Software

• JBool

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A subclass of Horn CNFs optimally compressible in polynomial time
• Analysis of approximation algorithms for \(k\)-set cover using factor-revealing linear programs
• Isoperimetric inequalities for faces of the cube and the grid
• Exclusive and essential sets of implicates of Boolean functions
• Horn minimization by iterative decomposition
• Optimal compression of propositional Horn knowledge bases: Complexity and approximation
• The minimum equivalent DNF problem and shortest implicants
• A Way to Simplify Truth Functions
• An Algorithm for a Minimum Cover of a Graph
• Minimal Representation of Directed Hypergraphs
• Minimum Covers in Relational Database Model
• Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search
• The complexity of theorem-proving procedures

This page was built for publication: Boolean functions with long prime implicants