The following pages link to (Q3002766):
Displaying 8 items.
- The limits of tractability in resolution-based propositional proof systems (Q408157) (← links)
- Towards strong nonapproximability results in the Lovász-Schrijver hierarchy (Q430828) (← links)
- Rank bounds for a hierarchy of Lovász and Schrijver (Q498445) (← links)
- Cutting planes and the parameter cutwidth (Q693047) (← links)
- Uncapacitated flow-based extended formulations (Q745688) (← links)
- Tight rank lower bounds for the Sherali-Adams proof system (Q1019183) (← links)
- On the Chvátal rank of the pigeonhole principle (Q1029351) (← links)
- Depth lower bounds in Stabbing Planes for combinatorial principles (Q6137876) (← links)
