Satisfiability of acyclic and almost acyclic CNF formulas (Q385062): Difference between revisions
From MaRDI portal
Latest revision as of 03:27, 7 July 2024
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
29 November 2013
0 references
acyclic hypergraph
0 references
chordal bipartite graph
0 references
Davis-Putnam resolution
0 references
0 references