Pages that link to "Item:Q1604210"
From MaRDI portal
The following pages link to The minimum equivalent DNF problem and shortest implicants (Q1604210):
Displaying 19 items.
- Solving QBF with counterexample guided refinement (Q253964) (← links)
- The complexity of computing minimal unidirectional covering sets (Q372959) (← links)
- A decomposition method for CNF minimality proofs (Q392185) (← links)
- 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)
- Recognition of tractable DNFs representable by a constant number of intervals (Q1751204) (← links)
- Extracting reaction systems from function behavior (Q1982974) (← links)
- Boolean functions with long prime implicants (Q2445231) (← links)
- Abstraction-Based Algorithm for 2QBF (Q3007686) (← links)
- Properties of Switch-List Representations of Boolean Functions (Q5130011) (← links)
- Approximating Minimum Representations of Key Horn Functions (Q5863327) (← links)
- Tractability of explaining classifier decisions (Q6098842) (← links)
- Matroid Horn functions (Q6187338) (← links)
