A stronger LP bound for formula size lower bounds via clique constraints (Q428879): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2012.02.005 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2149120558 / rank | |||
Normal rank | |||
Revision as of 00:00, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A stronger LP bound for formula size lower bounds via clique constraints |
scientific article |
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
