On the computational complexity of read once resolution decidability in 2CNF formulas (Q2988835)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the computational complexity of read once resolution decidability in 2CNF formulas |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9322266578674316
0 references
0.8602298498153687
0 references
0.824873149394989
0 references
0.8103345632553101
0 references
