Proof Complexity and the Binary Encoding of Combinatorial Principles

Dantchev, Stefan; Galesi, Nicola; Ghani, Abdul; Martin, Barnaby

doi:10.1137/20m134784x

Proof Complexity and the Binary Encoding of Combinatorial Principles

Dantchev, Stefan; Galesi, Nicola; Ghani, Abdul; Martin, Barnaby

Authors

Dr Stefan Dantchev s.s.dantchev@durham.ac.uk
Assistant Professor

Nicola Galesi

Abdul Ghani abdul.ghani@durham.ac.uk
PGR Student Doctor of Philosophy

Dr Barnaby Martin barnaby.d.martin@durham.ac.uk
Associate Professor

Citation

Dantchev, S., Galesi, N., Ghani, A., & Martin, B. (2024). Proof Complexity and the Binary Encoding of Combinatorial Principles. SIAM Journal on Computing, 53(3), 764-802. https://doi.org/10.1137/20m134784x

Journal Article Type	Article
Acceptance Date	Jun 9, 2024
Online Publication Date	Jun 24, 2024
Publication Date	Jun 30, 2024
Deposit Date	Sep 25, 2024
Publicly Available Date	Sep 27, 2024
Journal	SIAM Journal on Computing
Print ISSN	0097-5397
Electronic ISSN	1095-7111
Publisher	Society for Industrial and Applied Mathematics
Peer Reviewed	Peer Reviewed
Volume	53
Issue	3
Pages	764-802
DOI	https://doi.org/10.1137/20m134784x
Public URL	https://durham-repository.worktribe.com/output/2877493
Other Repo URL	https://arxiv.org/abs/2008.02138