A fast deterministic algorithm for formulas that have many satisfying assignments (Q4380447): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W1999002596 / rank
 
Normal rank

Latest revision as of 22:45, 19 March 2024

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