Connected Boolean functions with a locally extremal number of prime implicants
From MaRDI portal
Publication:5100123
DOI10.33048/daio.2021.28.699zbMath1496.94093OpenAlexW4256409617MaRDI QIDQ5100123
Publication date: 29 August 2022
Published in: Diskretnyi analiz i issledovanie operatsii (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/da1274
Boolean functionprime implicantlocal extremumconnected functionmaximum facenumber of prime implicants
Cites Work
- On the structure and the number of prime implicants of 2-\(\mathsf{CNF}\)s
- On the number of prime implicants
- Boolean function minimization in the class of disjunctive normal forms
- On k-Term DNF with the Largest Number of Prime Implicants
- Tools and Algorithms for the Construction and Analysis of Systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Connected Boolean functions with a locally extremal number of prime implicants