Pages that link to "Item:Q2254607"
From MaRDI portal
The following pages link to Hardness results for approximate pure Horn CNF formulae minimization (Q2254607):
Displaying 11 items.
- A decomposition method for CNF minimality proofs (Q392185) (← links)
- The joy of implications, aka pure Horn formulas: mainly a survey (Q507516) (← links)
- Hydras: complexity on general graphs and a subclass of trees (Q507535) (← links)
- Hydras: directed hypergraphs and Horn formulas (Q507537) (← links)
- A subclass of Horn CNFs optimally compressible in polynomial time (Q693287) (← links)
- Strong duality in Horn minimization (Q1679964) (← links)
- Autark assignments of Horn CNFs (Q1742887) (← links)
- Hardness results for approximate pure Horn CNF formulae minimization (Q2254607) (← links)
- On the hydra number of disconnected graphs (Q2322888) (← links)
- On the Approximability of Splitting-SAT in 2-CNF Horn Formulas (Q2870016) (← links)
- Approximating Minimum Representations of Key Horn Functions (Q5863327) (← links)