Tractability, hardness, and kernelization lower bound for and/or graph solution (Q2410230): Difference between revisions
From MaRDI portal
Latest revision as of 13:25, 14 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Tractability, hardness, and kernelization lower bound for and/or graph solution |
scientific article |
Statements
Tractability, hardness, and kernelization lower bound for and/or graph solution (English)
0 references
17 October 2017
0 references
and/or graphs
0 references
W[P]-complete
0 references
W[1]-hard
0 references
FPT
0 references
tree-width
0 references
clique-width
0 references
0 references
0 references