3 citations · 8 across the 7 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.CC2021
The Dynamic Complexity of Acyclic Hypergraph Homomorphisms
Nils Vortmeier, Ioannis Kokkinis
Finding a homomorphism from some hypergraph (or some relational structure) to another hypergraph is a fundamental problem in computer science. We show t…
cs.LO2021
Work-sensitive Dynamic Complexity of Formal Languages
Jonas Schmidt, Thomas Schwentick, Till Tantau +2
Which amount of parallel resources is needed for updating a query result after changing an input? In this work we study the amount of work required for dynamically answering member…