"Proof Complexity and the Binary Encoding of Combinatorial Principles."

Stefan S. Dantchev et al. (2024)

> Home

Details and statistics

DOI: 10.1137/20M134784X

access: closed

type: Journal Article

metadata version: 2024-07-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/DantchevGGM24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/DantchevGGM24
Stefan S. Dantchev, Nicola Galesi, Abdul Ghani, Barnaby Martin:
Proof Complexity and the Binary Encoding of Combinatorial Principles. SIAM J. Comput. 53(3): 764-802 (2024)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.