Pages that link to "Item:Q1087560"

The following pages link to Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas (Q1087560):

Displaying 2 items.

• On finding short resolution refutations and small unsatisfiable subsets (Q820148) (← links)
• Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. (Q1853541) (← links)