A stronger LP bound for formula size lower bounds via clique constraints (Q428879): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6049396 / rank
 
Normal rank
Property / zbMATH Keywords
 
formula size lower bound
Property / zbMATH Keywords: formula size lower bound / rank
 
Normal rank
Property / zbMATH Keywords
 
linear programming
Property / zbMATH Keywords: linear programming / rank
 
Normal rank
Property / zbMATH Keywords
 
monotone self-dual Boolean function
Property / zbMATH Keywords: monotone self-dual Boolean function / rank
 
Normal rank
Property / zbMATH Keywords
 
stable set polytope
Property / zbMATH Keywords: stable set polytope / rank
 
Normal rank

Revision as of 23:25, 29 June 2023

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