Pages that link to "Item:Q1656590"
From MaRDI portal
The following pages link to Minimal unsatisfiability and minimal strongly connected digraphs (Q1656590):
Displaying 5 items.
- On Davis-Putnam reductions for minimally unsatisfiable clause-sets (Q391124) (← links)
- Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas (Q1087560) (← links)
- The complete set of minimal simple graphs that support unsatisfiable 2-CNFs (Q2192070) (← links)
- Equivalence of strongly connected graphs and black-and-white 2-SAT problems (Q5379589) (← links)
- Classes of hard formulas for QBF resolution (Q6488807) (← links)