The Combined Basic LP and Affine IP Relaxation for Promise VCSPs on Infinite Domains
From MaRDI portal
Publication:5032030
DOI10.1145/3458041OpenAlexW3183881142MaRDI QIDQ5032030FDOQ5032030
Publication date: 16 February 2022
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.01779
Recommendations
- The combined basic LP and affine IP relaxation for promise VCSPs on infinite domains
- The power of the combined basic linear programming and affine relaxation for promise constraint satisfaction problems
- Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation
- The power of linear programming for general-valued CSPs
- The complexity of finite-valued CSPs
Cited In (3)
This page was built for publication: The Combined Basic LP and Affine IP Relaxation for Promise VCSPs on Infinite Domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5032030)