On the number of prime implicants
From MaRDI portal
Publication:1251656
DOI10.1016/0012-365X(78)90168-1zbMath0392.03038OpenAlexW2019184769MaRDI QIDQ1251656
George Markowsky, Ashok K. Chandra
Publication date: 1978
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(78)90168-1
Related Items
Learning union of integer hypercubes with queries (with applications to monadic decomposition), Fuzzy relational equations with min-biimplication composition, Implicates and prime implicates in random 3-SAT, Connected Boolean functions with a locally extremal number of prime implicants, Sur le cardinal maximum de la base complete d'une fonction booleenne, en fonction du nombre de conjonctions de l'une de ses formes normales, On the structure and the number of prime implicants of 2-\(\mathsf{CNF}\)s, On the complexity of detecting hazards, An incremental method for generating prime implicants/implicates, A logic-based analysis of Dempster-Shafer theory, First order LUB approximations: characterization and algorithms, A new lower bound on the expected size of irredundant forms for Boolean functions, Polynomial-time algorithms for generation of prime implicants, Exact learning of DNF formulas using DNF hypotheses, Boolean function minimization in the class of disjunctive normal forms, Proper learning of \(k\)-term DNF formulas from satisfying assignments, The approximation of implicates and explanations, Computing prime implicants via transversal clauses, Properties of Boolean functions with the extremal number of prime implicants
Cites Work
