Pages that link to "Item:Q4595958"
From MaRDI portal
The following pages link to On the Width of Semialgebraic Proofs and Algorithms (Q4595958):
Displaying 7 items.
- On space and depth in resolution (Q1616620) (← links)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II (Q2061899) (← links)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization (Q2687063) (← links)
- Complexity of optimizing over the integers (Q6160281) (← links)
- Perfect matching in random graphs is as hard as Tseitin (Q6562700) (← links)
- Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024 (Q6613418) (← links)
- Cutting planes width and the complexity of graph isomorphism refutations (Q6636618) (← links)
