scientific article; zbMATH DE number 7561702
From MaRDI portal
Publication:5092420
DOI10.4230/LIPIcs.MFCS.2019.58MaRDI QIDQ5092420
Christoph Berkholz, Nicole Schweikardt
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/2003.01075
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
fixed-parameter tractabilityconjunctive querieshypertree decompositionssubmodular widthconstant delay enumeration
Cites Work
- Tractable structures for constraint satisfaction with truth tables
- Finding and counting given length cycles
- Hypertree decompositions and tractable queries
- Enumeration Complexity of Logical Query Problems with Second-order Variables
- Enumeration of monadic second-order queries on trees
- On the Desirability of Acyclic Database Schemes
- Covers of Query Results
- Constraint solving via fractional edge covers
- On Acyclic Conjunctive Queries and Constant Delay Enumeration
- MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay
- Power of Natural Semijoins
- MSO queries on trees
- Size Bounds for Factorised Representations of Query Results
- MSO Queries on Trees
- First-order queries on structures of bounded degree are computable with constant delay
- Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
