Pages that link to "Item:Q1604210"
From MaRDI portal
The following pages link to The minimum equivalent DNF problem and shortest implicants (Q1604210):
Displayed 9 items.
- Boolean functions with a simple certificate for CNF complexity (Q412324) (← links)
- The complexity of Boolean formula minimization (Q619911) (← links)
- The complexity of variable minimal formulas (Q708020) (← links)
- Disjoint essential sets of implicates of a CQ Horn function (Q766268) (← links)
- An incremental algorithm for DLO quantifier elimination via constraint propagation (Q814643) (← links)
- Complexity of DNF minimization and isomorphism testing for monotone formulas (Q939444) (← links)
- Exclusive and essential sets of implicates of Boolean functions (Q968115) (← links)
- Approximability of minimum AND-circuits (Q1024782) (← links)
- Abstraction-Based Algorithm for 2QBF (Q3007686) (← links)