The connectivity of Boolean satisfiability: dichotomies for formulas and circuits (Q2411031): Difference between revisions

From MaRDI portal
Import241208061232 (talk | contribs)
Normalize DOI.
Import241208061232 (talk | contribs)
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1007/S00224-015-9663-Z / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1007/S00224-015-9663-Z / rank
 
Normal rank

Latest revision as of 11:40, 18 December 2024

scientific article
Language Label Description Also known as
English
The connectivity of Boolean satisfiability: dichotomies for formulas and circuits
scientific article

    Statements

    The connectivity of Boolean satisfiability: dichotomies for formulas and circuits (English)
    0 references
    20 October 2017
    0 references
    Boolean satisfiability
    0 references
    Boolean circuits
    0 references
    Post's lattice
    0 references
    PSPACE-completeness
    0 references
    dichotomy theorems
    0 references
    graph connectivity
    0 references
    0 references
    0 references

    Identifiers

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