Q3305351
type: Item
instance of: scholarly article
zbMATH Open document ID: 1489.68069
author: Christoph Berkholz
author: Jens Keppeler
author: Nicole Schweikardt
publication date: 2020-08-06T00:00:00Z
full work available at URL: https://arxiv.org/abs/1709.10039
Mathematics Subject Classification ID: 68P15
zbMATH DE Number: 7229070
zbMATH Keywords: dynamic query evaluation
zbMATH Keywords: union of conjunctive queries
zbMATH Keywords: constant-delay enumeration
zbMATH Keywords: counting problem
zbMATH Keywords: testing
MaRDI profile type: Publication
arXiv ID: 1709.10039
cites work: More Applications of the Polynomial Method to Algorithm Design
cites work: Q4864249
cites work: On Acyclic Conjunctive Queries and Constant Delay Enumeration
cites work: A Trichotomy in the Complexity of Counting Answers to Conjunctive Queries
cites work: Q3651735
cites work: The complexity of counting homomorphisms seen from the other side
cites work: Structural tractability of counting of solutions to conjunctive queries
cites work: Size and Treewidth Bounds for Conjunctive Queries
cites work: The complexity of homomorphism and constraint satisfaction problems seen from the other side
cites work: When is the evaluation of conjunctive queries tractable?
cites work: Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture
cites work: Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries
cites work: Dyn-FO: A parallel, dynamic complexity class
DOI: 10.4230/LIPICS.ICDT.2018.8
description: scientific article