Pages that link to "Item:Q1278038"
From MaRDI portal
The following pages link to Arity bounds in first-order incremental evaluation and definition of polynomial time database queries (Q1278038):
Displaying 12 items.
- First-order queries on databases embedded in an infinite structure (Q1350000) (← links)
- Incremental recomputation in local languages. (Q1401928) (← links)
- Incremental and decremental evaluation of transitive closure by first- order queries (Q1898482) (← links)
- Maintenance of datalog materialisations revisited (Q2321273) (← links)
- Dynamic conjunctive queries (Q2361342) (← links)
- The dynamic descriptive complexity of \(k\)-clique (Q2407083) (← links)
- On the quantifier-free dynamic complexity of reachability (Q2514150) (← links)
- Reachability is in DynFO (Q3449473) (← links)
- SEPARATING AUXILIARY ARITY HIERARCHY OF FIRST-ORDER INCREMENTAL EVALUATION SYSTEMS USING (3K+1)-<font>ary</font> INPUT RELATIONS (Q4528763) (← links)
- (Q5028429) (← links)
- First-order queries on structures of bounded degree are computable with constant delay (Q5277786) (← links)
- First-order definable counting-only queries (Q5915664) (← links)
