Satisfiability of Acyclic and Almost Acyclic CNF Formulas. (Q2908839): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| label / en | label / en | ||
Satisfiability of Acyclic and Almost Acyclic CNF Formulas. | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2287549241 / rank | |||
Normal rank | |||
| Property / title | |||
Satisfiability of Acyclic and Almost Acyclic CNF Formulas. (English) | |||
| Property / title: Satisfiability of Acyclic and Almost Acyclic CNF Formulas. (English) / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 11:32, 30 July 2024
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
