Pages that link to "Item:Q2497988"
From MaRDI portal
The following pages link to Edmonds polytopes and a hierarchy of combinatorial problems. (Reprint) (Q2497988):
Displaying 4 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)
