Proof complexity and the binary encoding of combinatorial principles (Q6562831)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Proof complexity and the binary encoding of combinatorial principles |
scientific article; zbMATH DE number 7872151
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Proof complexity and the binary encoding of combinatorial principles |
scientific article; zbMATH DE number 7872151 |
Statements
Proof complexity and the binary encoding of combinatorial principles (English)
0 references
27 June 2024
0 references
propositional proof complexity
0 references
resolution
0 references
lift-and-project methods
0 references
Sherali-Adams
0 references
binary encoding
0 references
0 references
0 references
0 references
0 references
