Satisfiability of acyclic and almost acyclic CNF formulas (Q385062): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2012.12.039 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2141898804 / rank | |||
Normal rank | |||
Revision as of 01:04, 20 March 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
