The limits of tractability in resolution-based propositional proof systems (Q408157)
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: The limits of tractability in resolution-based propositional proof systems |
scientific article; zbMATH DE number 6019354
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The limits of tractability in resolution-based propositional proof systems |
scientific article; zbMATH DE number 6019354 |
Statements
The limits of tractability in resolution-based propositional proof systems (English)
0 references
29 March 2012
0 references
propositional proof complexity
0 references
resolution with bounded conjunction
0 references
lower bounds
0 references
0.9985643029212952
0 references
0.7891334891319275
0 references
0.780733048915863
0 references
0.7741992473602295
0 references
0.7729092240333557
0 references
