MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in $\mathcal{O}(2^n)$ Time (Q5756576)

From MaRDI portal
Revision as of 21:54, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5187235
Language Label Description Also known as
English
MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in $\mathcal{O}(2^n)$ Time
scientific article; zbMATH DE number 5187235

    Statements

    MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in $\mathcal{O}(2^n)$ Time (English)
    0 references
    0 references
    0 references
    0 references
    4 September 2007
    0 references
    0 references
    0 references