A stronger LP bound for formula size lower bounds via clique constraints (Q428879)
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: A stronger LP bound for formula size lower bounds via clique constraints |
scientific article; zbMATH DE number 6049396
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A stronger LP bound for formula size lower bounds via clique constraints |
scientific article; zbMATH DE number 6049396 |
Statements
A stronger LP bound for formula size lower bounds via clique constraints (English)
0 references
25 June 2012
0 references
formula size lower bound
0 references
linear programming
0 references
monotone self-dual Boolean function
0 references
stable set polytope
0 references
0 references
0 references
0.9963772892951964
0 references
0.8290729522705078
0 references
0.8210723400115967
0 references
0.8014256358146667
0 references
0.7714009284973145
0 references
