Satisfiability of acyclic and almost acyclic CNF formulas (Q385062)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6234620
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Satisfiability of acyclic and almost acyclic CNF formulas |
scientific article; zbMATH DE number 6234620 |
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
0 references
0.9752512
0 references
0.9216251
0 references
0 references
0 references
0 references
0.89687353
0 references
