Pages that link to "Item:Q1376403"

The following pages link to Dyn-FO: A parallel, dynamic complexity class (Q1376403):

Displaying 18 items.

• The dynamic complexity of transitive closure is in DynTC\(^{0}\). (Q1401284) (← links)
• Incremental recomputation in local languages. (Q1401928) (← links)
• Local properties of query languages (Q1575140) (← links)
• Dynamic kernels for hitting sets and set packing (Q2093581) (← links)
• Dynamic complexity of expansion (Q2117075) (← links)
• Modular materialisation of Datalog programs (Q2144176) (← links)
• Work-sensitive dynamic complexity of formal languages (Q2233429) (← links)
• Maintenance of datalog materialisations revisited (Q2321273) (← links)
• The dynamic descriptive complexity of \(k\)-clique (Q2407083) (← links)
• On the quantifier-free dynamic complexity of reachability (Q2514150) (← links)
• The dynamic complexity of acyclic hypergraph homomorphisms (Q2672439) (← links)
• Dynamic Complexity of the Dyck Reachability (Q2988373) (← links)
• (Q3305351) (← links)
• Reachability is in DynFO (Q3449473) (← links)
• (Q5002805) (← links)
• (Q5028429) (← links)
• Dynamic algorithms for the Dyck languages (Q5057425) (← links)
• (Q5376663) (← links)