Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas (Q2075363): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10472-021-09762-2 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10472-021-09762-2 / rank | |||
Normal rank | |||
Latest revision as of 23:40, 16 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas |
scientific article |
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
