Satisfiability of acyclic and almost acyclic CNF formulas (Q2908839)
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 6073522
| 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 6073522 |
Statements
29 August 2012
0 references
satisfiability
0 references
chordal bipartite graphs
0 references
\(\beta\)-acyclic hypergraphs
0 references
backdoor sets
0 references
parameterized complexity
0 references
0 references
0.9752512
0 references
0.9216251
0 references
0 references
0 references
0 references
0.89687353
0 references
Satisfiability of acyclic and almost acyclic CNF formulas (English)
0 references
