On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas (Q2988835)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas |
scientific article |
Statements
On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas (English)
0 references
19 May 2017
0 references
2SAT
0 references
resolution
0 references
read-once
0 references
0 references
