The parameterized complexity and kernelization of resilience for database queries (Q2202009)
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 7248843
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The parameterized complexity and kernelization of resilience for database queries |
scientific article; zbMATH DE number 7248843 |
Statements
The parameterized complexity and kernelization of resilience for database queries (English)
0 references
17 September 2020
0 references
In this paper, the authors examine the complexity of the resilience decision problem by means of parameterized complexity. It is observed that a triangle query is fixed parameter tractable if the data has the planarity property with respect to the triangle query.
0 references
resilience
0 references
conjunctive query
0 references
parameterized complexity
0 references
0.7942109704017639
0 references
0.7663803100585938
0 references
0.7170100212097168
0 references
