Pages that link to "Item:Q1408380"
From MaRDI portal
The following pages link to On the structure of some classes of minimal unsatisfiable formulas (Q1408380):
Displaying 7 items.
- Disproof of the neighborhood conjecture with implications to SAT (Q377802) (← links)
- Computing unsatisfiable \(k\)-SAT instances with few occurrences per variable (Q557836) (← links)
- Finding read-once resolution refutations in systems of 2CNF clauses (Q1749535) (← links)
- New width parameters for SAT and \#SAT (Q2238644) (← links)
- On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas (Q2988835) (← links)
- Community Structure Inspired Algorithms for SAT and #SAT (Q3453228) (← links)
- Are hitting formulas hard for resolution? (Q6162037) (← links)
