An exponential lower bound for a constraint propagation proof system based on ordered binary decision diagrams (Q5387310)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5273204
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exponential lower bound for a constraint propagation proof system based on ordered binary decision diagrams |
scientific article; zbMATH DE number 5273204 |
Statements
An exponential lower bound for a constraint propagation proof system based on ordered binary decision diagrams (English)
0 references
8 May 2008
0 references
propositional proof system
0 references
lower bound
0 references
ordered binary decision diagrams
0 references
feasible interpolation
0 references
communication complexity
0 references
proof complexity
0 references
constraint propagation
0 references
0.8746998310089111
0 references
0.8226870894432068
0 references
0.8112789392471313
0 references
0.8066739439964294
0 references
