Pages that link to "Item:Q392185"
From MaRDI portal
The following pages link to A decomposition method for CNF minimality proofs (Q392185):
Displaying 11 items.
- Succinctness and tractability of closure operator representations (Q507522) (← links)
- Hydras: complexity on general graphs and a subclass of trees (Q507535) (← links)
- Horn minimization by iterative decomposition (Q1277344) (← links)
- Minimal samples of positive examples identifying \(k\)-CNF Boolean functions (Q1333259) (← links)
- Strong duality in Horn minimization (Q1679964) (← links)
- Recognition of tractable DNFs representable by a constant number of intervals (Q1751204) (← links)
- Hardness results for approximate pure Horn CNF formulae minimization (Q2254607) (← links)
- Redundancy in logic. II: 2CNF and Horn propositional formulae (Q2389621) (← links)
- Minimality of the correctness criterion for multiplicative proof nets (Q4236199) (← links)
- Properties of Switch-List Representations of Boolean Functions (Q5130011) (← links)
- Approximating Minimum Representations of Key Horn Functions (Q5863327) (← links)