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

From MaRDI portal
Revision as of 19:12, 28 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(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
    17 March 1998
    0 references
    satisfying assignment for a Boolean formula
    0 references
    deterministic algorithm
    0 references

    Identifiers