Pages that link to "Item:Q412324"
From MaRDI portal
The following pages link to Boolean functions with a simple certificate for CNF complexity (Q412324):
Displaying 11 items.
- Disjoint essential sets of implicates of a CQ Horn function (Q766268) (← links)
- Exclusive and essential sets of implicates of Boolean functions (Q968115) (← links)
- Recognition of tractable DNFs representable by a constant number of intervals (Q1751204) (← links)
- On the gap between \(\mathit{ess}(f)\) and \(\mathit{cnf}_{-}\mathit{size}(f)\) (Q1759859) (← links)
- Boolean functions with long prime implicants (Q2445231) (← links)
- On converting CNF to DNF (Q2576880) (← links)
- On Minimum Representations of Matched Formulas (Q2938476) (← links)
- О весах булевых функций, представимых в виде $2$-КНФ или $3$-КНФ (Q3382008) (← links)
- Mathematical Foundations of Computer Science 2003 (Q5431349) (← links)
- Diameter Versus Certificate Complexity of Boolean Functions (Q6168445) (← links)
- The ghosts of forgotten things: a study on size after forgetting (Q6560989) (← links)