On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances (Q5369245)
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 Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances |
scientific article; zbMATH DE number 6791403
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances |
scientific article; zbMATH DE number 6791403 |
Statements
On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances (English)
0 references
16 October 2017
0 references
CNF formulas
0 references
parameterized complexity
0 references
backbones
0 references
constraint satisfaction
0 references
unsatisfiable subsets
0 references
