Satisfiability of acyclic and almost acyclic CNF formulas (Q385062): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03B05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C65 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6234620 / rank
 
Normal rank
Property / zbMATH Keywords
 
acyclic hypergraph
Property / zbMATH Keywords: acyclic hypergraph / rank
 
Normal rank
Property / zbMATH Keywords
 
chordal bipartite graph
Property / zbMATH Keywords: chordal bipartite graph / rank
 
Normal rank
Property / zbMATH Keywords
 
Davis-Putnam resolution
Property / zbMATH Keywords: Davis-Putnam resolution / rank
 
Normal rank

Revision as of 13:40, 29 June 2023

scientific article
Language Label Description Also known as
English
Satisfiability of acyclic and almost acyclic CNF formulas
scientific article

    Statements

    Satisfiability of acyclic and almost acyclic CNF formulas (English)
    0 references
    0 references
    0 references
    0 references
    29 November 2013
    0 references
    acyclic hypergraph
    0 references
    chordal bipartite graph
    0 references
    Davis-Putnam resolution
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references