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

From MaRDI portal
Revision as of 11:40, 18 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The connectivity of Boolean satisfiability: dichotomies for formulas and circuits
scientific article

    Statements

    title
    The connectivity of Boolean satisfiability: dichotomies for formulas and circuits (English)
    0 references
    publication date
    20 October 2017
    0 references
    zbMATH Keywords
    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
    cites work
    Q3194807
    0 references
    Q4393484
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    03B05
    0 references
    05C40
    0 references
    68Q17
    0 references
    94C11
    0 references
    zbMATH DE Number
    6793997
    0 references
    OpenAlex ID
    W2787312740
    0 references
    arXiv ID
    1312.6679
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2411031&oldid=39064788"
    Powered by MediaWiki