The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies (Q5902502)

From MaRDI portal
Revision as of 10:39, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article; zbMATH DE number 5653734
Language Label Description Also known as
English
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
scientific article; zbMATH DE number 5653734

    Statements

    The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies (English)
    0 references
    0 references
    0 references
    0 references
    6 January 2010
    0 references
    Boolean satisfiability
    0 references
    computational complexity
    0 references
    constraint satisfaction problem
    0 references
    dichotomy theorems
    0 references
    graph connectivity
    0 references
    graph of solutions
    0 references
    PSPACE-completeness
    0 references
    solution spaces of Boolean formulas
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references