scientific article
From MaRDI portal
Publication:3305351
DOI10.4230/LIPIcs.ICDT.2018.8zbMath1489.68069arXiv1709.10039MaRDI QIDQ3305351
Christoph Berkholz, Jens Keppeler, Nicole Schweikardt
Publication date: 6 August 2020
Full work available at URL: https://arxiv.org/abs/1709.10039
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
testingcounting problemconstant-delay enumerationdynamic query evaluationunion of conjunctive queries
Related Items (6)
Enumeration for FO Queries over Nowhere Dense Graphs ⋮ Range updates and range sum queries on multidimensional points with monoid weights ⋮ Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries ⋮ How fast can we play Tetris greedily with rectangular pieces? ⋮ Unnamed Item ⋮ Counting Triangles under Updates in Worst-Case Optimal Time
Cites Work
- Unnamed Item
- Unnamed Item
- Structural tractability of counting of solutions to conjunctive queries
- The complexity of counting homomorphisms seen from the other side
- Dyn-FO: A parallel, dynamic complexity class
- Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture
- The complexity of homomorphism and constraint satisfaction problems seen from the other side
- On Acyclic Conjunctive Queries and Constant Delay Enumeration
- When is the evaluation of conjunctive queries tractable?
- More Applications of the Polynomial Method to Algorithm Design
- Size and Treewidth Bounds for Conjunctive Queries
- Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries
- A Trichotomy in the Complexity of Counting Answers to Conjunctive Queries
This page was built for publication:
