Satisfiability of acyclic and almost acyclic CNF formulas (Q385062)

From MaRDI portal
Revision as of 03:27, 7 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Satisfiability of acyclic and almost acyclic CNF formulas
scientific article

    Statements

    title
    Satisfiability of acyclic and almost acyclic CNF formulas (English)
    0 references
    author
    Sebastian Ordyniak
    0 references
    Daniël Paulusma
    0 references
    Stefan Szeider
    0 references
    publication date
    29 November 2013
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    03B05
    0 references
    05C85
    0 references
    05C65
    0 references
    zbMATH DE Number
    6234620
    0 references
    zbMATH Keywords
    acyclic hypergraph
    0 references
    chordal bipartite graph
    0 references
    Davis-Putnam resolution
    0 references
    OpenAlex ID
    W2141898804
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q385062&oldid=35363211"
    Powered by MediaWiki