A stronger LP bound for formula size lower bounds via clique constraints (Q428879)

From MaRDI portal
Revision as of 22:25, 29 June 2023 by Importer (talk | contribs) (‎Changed an Item)
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
    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

    Identifiers