Dr Stefan Dantchev s.s.dantchev@durham.ac.uk
Assistant Professor
Sherali-Adams and the binary encoding of combinatorial principles
Dantchev, Stefan; Ghani, Abdul; Martin, Barnaby
Authors
Abdul Aziz Saud Abdul Ghani abdul.ghani@durham.ac.uk
PGR Student Doctor of Philosophy
Dr Barnaby Martin barnaby.d.martin@durham.ac.uk
Associate Professor
Contributors
Yoshiharu Kohayakawa
Editor
Flávio Keidi Miyazawa
Editor
Abstract
We consider the Sherali-Adams ( SA ) refutation system together with the unusual binary encoding of certain combinatorial principles. For the unary encoding of the Pigeonhole Principle and the Least Number Principle, it is known that linear rank is required for refutations in SA , although both admit refutations of polynomial size. We prove that the binary encoding of the Pigeonhole Principle requires exponentially-sized SA refutations, whereas the binary encoding of the Least Number Principle admits logarithmic rank, polynomially-sized SA refutations. We continue by considering a refutation system between SA and Lasserre (Sum-of-Squares). In this system, the unary encoding of the Least Number Principle requires linear rank while the unary encoding of the Pigeonhole Principle becomes constant rank.
Citation
Dantchev, S., Ghani, A., & Martin, B. (2020). Sherali-Adams and the binary encoding of combinatorial principles. In Y. Kohayakawa, & F. K. Miyazawa (Eds.), LATIN 2020: Theoretical Informatics (336-347). https://doi.org/10.1007/978-3-030-61792-9_27
Conference Name | LATIN 2020 |
---|---|
Conference Location | São Paulo, Brazil |
Start Date | May 25, 2020 |
End Date | May 29, 2020 |
Acceptance Date | Feb 10, 2020 |
Online Publication Date | Dec 3, 2020 |
Publication Date | 2020 |
Deposit Date | Jun 29, 2020 |
Publicly Available Date | Jun 30, 2020 |
Publisher | Springer Verlag |
Volume | 12118 |
Pages | 336-347 |
Series Title | Lecture Notes in Computer Science |
Book Title | LATIN 2020: Theoretical Informatics |
ISBN | 9783030617912 |
DOI | https://doi.org/10.1007/978-3-030-61792-9_27 |
Public URL | https://durham-repository.worktribe.com/output/1140499 |
Related Public URLs | https://arxiv.org/abs/1911.00403 |
Files
Accepted Conference Proceeding
(289 Kb)
PDF
Copyright Statement
The final authenticated version is available online at https://doi.org/10.1007/978-3-030-61792-9_27
You might also like
Combinatorial Axiomatisation of Edge-weighted PageRank
(2016)
Journal Article
Relativization makes contradictions harder for Resolution
(2013)
Journal Article
Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems
(2012)
Journal Article
Cutting Planes and the Parameter Cutwidth
(2012)
Journal Article
Parameterized Proof Complexity
(2011)
Journal Article
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search