Pages that link to "Item:Q693287"
From MaRDI portal
The following pages link to A subclass of Horn CNFs optimally compressible in polynomial time (Q693287):
Displaying 10 items.
- A decomposition method for CNF minimality proofs (Q392185) (← links)
- The joy of implications, aka pure Horn formulas: mainly a survey (Q507516) (← links)
- Disjoint essential sets of implicates of a CQ Horn function (Q766268) (← links)
- Recognition of tractable DNFs representable by a constant number of intervals (Q1751204) (← links)
- Translating between the representations of a ranked convex geometry (Q2032718) (← links)
- Optimum basis of finite convex geometry (Q2399285) (← links)
- Boolean functions with long prime implicants (Q2445231) (← links)
- Properties of Switch-List Representations of Boolean Functions (Q5130011) (← links)
- Approximating Minimum Representations of Key Horn Functions (Q5863327) (← links)
- Dualization in lattices given by implicational bases (Q5919405) (← links)
