Basu–Conforti–Di Summa–Jiang split-rank conjecture
This entry tracks Basu–Conforti–Di Summa–Jiang split-rank conjecture.
It resolves a conjecture about split-cut complexity with an explicit quantitative guarantee.
Latest development
A polynomial bound is established in the dense binary encoding length for rational pure-integer polyhedra.
Editorial caveat
The preprint is unrefereed and lacks independent expert assessment.
References
- A Polynomial Bound on Split Rank — arXiv — Avinash Bhardwaj, Vishnu Narayanan
Source: arXiv
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.