Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: The Dynamic Complexity of Acyclic Hypergraph Homomorphisms   Finding a homomorphism from some hypergraph $\mathcal{Q}$ (or some relational
structure) to another hypergraph $\mathcal{D}$ is a fundamental problem in
computer science. We show that an answer to this problem can be maintained
under single-edge changes of $\mathcal{Q}$, as long as it stays acyclic, in the
DynFO framework of Patnaik and Immerman that uses updates expressed in
first-order logic. If additionally also changes of $\mathcal{D}$ are allowed,
we show that it is unlikely that existence of homomorphisms can be maintained
in DynFO.

32
The categories of this paper are: atom-ph
20
The categories of this paper are: acc-phys
4
The categories of this paper are: cond-mat
13
The categories of this paper are: quant-ph
37
The categories of this paper are: supr-con
26
The categories of this paper are: bayes-an
25
The categories of this paper are: patt-sol
16
The categories of this paper are: stat
12
The categories of this paper are: nucl-th
33
The categories of this paper are: plasm-ph
3
The categories of this paper are: physics
14
The categories of this paper are: math-ph
19
The categories of this paper are: eess
7
The categories of this paper are: hep-th
6
The categories of this paper are: astro-ph
27
The categories of this paper are: comp-gas