1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.LO2017★ 1 cited
Dynamic Complexity under Definable Changes
Thomas Schwentick, Nils Vortmeier, Thomas Zeume
This paper studies dynamic complexity under definable change operations in the DynFO framework by Patnaik and Immerman. It is shown that for changes definable by parameter-free fir…
cs.LO2016
The Dynamic Descriptive Complexity of k-Clique
Thomas Zeume
In this work the dynamic descriptive complexity of the k-clique query is studied. It is shown that when edges may only be inserted then k-clique can be maintained by a quantifier-f…