scientific article
From MaRDI portal
Publication:3305356
DOI10.4230/LIPIcs.ICDT.2018.11zbMath1489.68072arXiv1712.07880MaRDI QIDQ3305356
Publication date: 6 August 2020
Full work available at URL: https://arxiv.org/abs/1712.07880
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Combinatorics in computer science (68R05) Data structures (68P05)
Related Items (4)
Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries ⋮ A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties ⋮ Finding small satisfying assignments faster than brute force: a fine-grained perspective into boolean constraint satisfaction ⋮ Enumeration complexity of conjunctive queries with functional dependencies
Cites Work
- Unnamed Item
- Unnamed Item
- On the complexity of database queries
- Sorting, linear time and the satisfiability problem
- A complexity theory for hard enumeration problems
- On the Desirability of Acyclic Database Schemes
- Powers of tensors and fast matrix multiplication
- On Acyclic Conjunctive Queries and Constant Delay Enumeration
This page was built for publication:
