The following pages link to On the number of prime implicants (Q1251656):
Displaying 18 items.
- A new lower bound on the expected size of irredundant forms for Boolean functions (Q673913) (← links)
- Learning union of integer hypercubes with queries (with applications to monadic decomposition) (Q832265) (← links)
- On the structure and the number of prime implicants of 2-\(\mathsf{CNF}\)s (Q906424) (← links)
- An incremental method for generating prime implicants/implicates (Q917336) (← links)
- A logic-based analysis of Dempster-Shafer theory (Q918733) (← links)
- 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 (Q1149955) (← links)
- Polynomial-time algorithms for generation of prime implicants (Q1190532) (← links)
- The approximation of implicates and explanations (Q1308780) (← links)
- Boolean function minimization in the class of disjunctive normal forms (Q1825217) (← links)
- Fuzzy relational equations with min-biimplication composition (Q1927264) (← links)
- On the complexity of detecting hazards (Q2203575) (← links)
- Proper learning of \(k\)-term DNF formulas from satisfying assignments (Q2323349) (← links)
- First order LUB approximations: characterization and algorithms (Q2457687) (← links)
- Implicates and prime implicates in random 3-SAT (Q2674186) (← links)
- Computing prime implicants via transversal clauses (Q4243266) (← links)
- Connected Boolean functions with a locally extremal number of prime implicants (Q5100123) (← links)
- Properties of Boolean functions with the extremal number of prime implicants (Q5878614) (← links)
- Exact learning of DNF formulas using DNF hypotheses (Q5916223) (← links)
