activity
20122021
most citedResolution and the binary encoding of combinatorial principles

2 citations · 4 across the 5 of their papers we have counts for

collaborators
Showing 2020Show all

1 paper · 1 filter

cs.LO2020★ 1 cited

Proof complexity and the binary encoding of combinatorial principles

Stefan Dantchev, Nicola Galesi, Abdul Ghani +1

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 severa…