AI Chat AI Image Generator AI Video Text to Speech

Proof complexity and the binary encoding of combinatorial principles

08/04/2020

∙

by Stefan Dantchev, et al.

∙

∙

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.

Stefan Dantchev
4 publications
Nicola Galesi
7 publications
Abdul Ghani
3 publications
Barnaby Martin
30 publications

page 1

page 2

page 3

page 4

research

∙ 11/01/2019

Sherali-Adams and the binary encoding of combinatorial principles

We consider the Sherali-Adams (SA) refutation system together with the u...

0 Stefan Dantchev, et al. ∙

research

∙ 09/08/2018

Resolution and the binary encoding of combinatorial principles

We investigate the size complexity of proofs in Res(s) -- an extension o...

0 Stefan Dantchev, et al. ∙

research

∙ 01/15/2023

The Binary Linearization Complexity of Pseudo-Boolean Functions

We consider the problem of linearizing a pseudo-Boolean function f : {0,...

0 Matthias Walter, et al. ∙

research

∙ 04/29/2021

One more proof of the first linear programming bound for binary codes and two conjectures

We give one more proof of the first linear programming bound for binary ...

0 Alex Samorodnitsky, et al. ∙

research

∙ 05/12/2020

Yet Another Comparison of SAT Encodings for the At-Most-K Constraint

The at-most-k constraint is ubiquitous in combinatorial problems, and nu...

0 Neng-Fa Zhou, et al. ∙

research

∙ 04/13/2022

Mixed-Integer Programming for Signal Temporal Logic with Fewer Binary Variables

Signal Temporal Logic (STL) provides a convenient way of encoding comple...

0 Vince Kurtz, et al. ∙

research

∙ 02/02/2020

Caterpillars on three and four leaves are sufficient to reconstruct normal networks

While every rooted binary phylogenetic tree is determined by its set of ...

0 Simone Linz, et al. ∙