Pages that link to "Item:Q5277786"
From MaRDI portal
The following pages link to First-order queries on structures of bounded degree are computable with constant delay (Q5277786):
Displaying 20 items.
- A logical approach to locality in pictures languages (Q295631) (← links)
- On enumerating monomials and other combinatorial structures by polynomial interpolation (Q385504) (← links)
- An optimal construction of Hanf sentences (Q420856) (← links)
- Compact labelings for efficient first-order model-checking (Q626458) (← links)
- Tree inclusions in windows and slices (Q843598) (← links)
- Linear delay enumeration and monadic second-order logic (Q967312) (← links)
- A complexity theory for hard enumeration problems (Q2274092) (← links)
- Structural tractability of enumerating CSP solutions (Q2342585) (← links)
- Answering FO+MOD queries under updates on bounded degree databases (Q3174897) (← links)
- Constant delay enumeration for FO queries over databases with local bounded expansion (Q3174913) (← links)
- Enumeration on trees under relabelings (Q3305348) (← links)
- Efficient First-Order Model-Checking Using Short Labels (Q3507329) (← links)
- Computing the<i>j</i>th solution of a first-order query (Q3514640) (← links)
- (Q5002812) (← links)
- Answering FO+MOD Queries under Updates on Bounded Degree Databases (Q5012590) (← links)
- (Q5092420) (← links)
- (Q5094135) (← links)
- (Q5109514) (← links)
- Enumeration for FO Queries over Nowhere Dense Graphs (Q5889796) (← links)
- Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries (Q6135781) (← links)