scientific article; zbMATH DE number 7566063
From MaRDI portal
Publication:5094135
No author found.
Publication date: 2 August 2022
Full work available at URL: https://arxiv.org/abs/2010.08382
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
Enumeration for FO Queries over Nowhere Dense Graphs ⋮ Enumerating teams in first-order team logics ⋮ Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph properties checkable in linear time in the number of vertices
- Algorithmic uses of the Feferman-Vaught theorem
- Linear delay enumeration and monadic second-order logic
- The complexity of first-order and monadic second-order logic revisited
- Parametrized complexity theory.
- Domination Problems in Nowhere-Dense Classes
- Enumeration of monadic second-order queries on trees
- On Acyclic Conjunctive Queries and Constant Delay Enumeration
- MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay
- Deciding First-Order Properties of Nowhere Dense Graphs
- First-order queries on structures of bounded degree are computable with constant delay
- Testing first-order properties for subclasses of sparse graphs
- Model Theory Makes Formulas Large
This page was built for publication:
