Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas (Q2075363)
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: Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas |
scientific article; zbMATH DE number 7473192
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas |
scientific article; zbMATH DE number 7473192 |
Statements
Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas (English)
0 references
14 February 2022
0 references
2CNF
0 references
read-once resolution
0 references
NP-hard
0 references
exact exponential algorithms
0 references
0.94287235
0 references
0.9350592
0 references
0.9076786
0 references
0.8988844
0 references
0.8893403
0 references
0.87277025
0 references
0.8667386
0 references
0.86191046
0 references
