Treewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic Encodings (Q5505579)

From MaRDI portal
Revision as of 15:19, 19 March 2024 by Openalex240319020357 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5498365
Language Label Description Also known as
English
Treewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic Encodings
scientific article; zbMATH DE number 5498365

    Statements

    Treewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic Encodings (English)
    0 references
    0 references
    0 references
    27 January 2009
    0 references
    0 references
    0 references