On the structure and the number of prime implicants of 2-\(\mathsf{CNF}\)s
From MaRDI portal
Publication:906424
DOI10.1016/j.dam.2015.06.036zbMath1330.94067arXiv1408.2662MaRDI QIDQ906424
Publication date: 21 January 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.2662
computational complexity; combinatorial problems; Boolean function; prime implicant; conjunctive normal form
68Q25: Analysis of algorithms and problem complexity
Related Items
Cites Work