Pages that link to "Item:Q2497988"

The following pages link to Edmonds polytopes and a hierarchy of combinatorial problems. (Reprint) (Q2497988):

Displaying 5 items.

• Tight rank lower bounds for the Sherali-Adams proof system (Q1019183) (← links)
• Caps and progression-free sets in \(\mathbb{Z}_m^n\) (Q2004972) (← links)
• A computational complexity comparative study of graph tessellation problems (Q2222093) (← links)
• The Complexity of Propositional Proofs (Q5444711) (← links)
• Proving the infeasibility of Horn formulas through read-once resolution (Q6558679) (← links)