Satisfiability of Acyclic and Almost Acyclic CNF Formulas. (Q2908839)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Satisfiability of Acyclic and Almost Acyclic CNF Formulas. |
scientific article |
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
Satisfiability of Acyclic and Almost Acyclic CNF Formulas. (English)
0 references
