Proof complexity and the binary encoding of combinatorial principles
Logic in Computer Science
2022-04-06 v2 Computational Complexity
Abstract
We consider Proof Complexity in light of the unusual binary encoding of certain combinatorial principles. We contrast this Proof Complexity with the normal unary encoding in several refutation systems, based on Resolution and Integer Linear Programming. Please consult the article for the full abstract.
Cite
@article{arxiv.2008.02138,
title = {Proof complexity and the binary encoding of combinatorial principles},
author = {Stefan Dantchev and Nicola Galesi and Abdul Ghani and Barnaby Martin},
journal= {arXiv preprint arXiv:2008.02138},
year = {2022}
}
Comments
arXiv admin note: substantial text overlap with arXiv:1809.02843, arXiv:1911.00403