On k-Term DNF with the Largest Number of Prime Implicants

DOI10.1137/050632026zbMATH Open1158.94008OpenAlexW2045008295MaRDI QIDQ3544247FDOQ3544247

Authors: Balázs Szörényi, Gy. Turán, R. H. Sloan 

Publication date: 5 December 2008

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/050632026

Recommendations

• Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments
• scientific article; zbMATH DE number 3226235
• Mathematical Foundations of Computer Science 2005
• CNF and DNF considered harmful for computing prime implicants/implicates
• On the maximal minimal cube lengths in distinct DNF tautologies

zbMATH Keywords

disjunctive normal formprime implicantdisjoint DNF

Mathematics Subject Classification ID

Cited In (5)

• Connected Boolean functions with a locally extremal number of prime implicants
• Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments
• Prime forms and minimal change in propositional belief bases
• On the structure and the number of prime implicants of 2-\(\mathsf{CNF}\)s
• On the maximal minimal cube lengths in distinct DNF tautologies

This page was built for publication: On k-Term DNF with the Largest Number of Prime Implicants

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3544247)