Tractability, hardness, and kernelization lower bound for and/or graph solution (Q2410230)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6792116
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tractability, hardness, and kernelization lower bound for and/or graph solution |
scientific article; zbMATH DE number 6792116 |
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
0.8370136022567749
0 references
0.7331833839416504
0 references
