Sherali-Adams and the binary encoding of combinatorial principles
From MaRDI portal
Publication:2081629
DOI10.1007/978-3-030-61792-9_27OpenAlexW3044646794MaRDI QIDQ2081629
Publication date: 13 October 2022
Full work available at URL: https://arxiv.org/abs/1911.00403
Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)
Related Items (2)
Proof complexity and the binary encoding of combinatorial principles ⋮ On the strength of Sherali-Adams and Nullstellensatz as propositional proof systems
This page was built for publication: Sherali-Adams and the binary encoding of combinatorial principles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2081629)
