A fast deterministic algorithm for formulas that have many satisfying assignments (Q4380447)

From MaRDI portal
Revision as of 23:45, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1129207
Language Label Description Also known as
English
A fast deterministic algorithm for formulas that have many satisfying assignments
scientific article; zbMATH DE number 1129207

    Statements

    A fast deterministic algorithm for formulas that have many satisfying assignments (English)
    0 references
    0 references
    0 references
    17 March 1998
    0 references
    0 references
    satisfying assignment for a Boolean formula
    0 references
    deterministic algorithm
    0 references
    0 references