On the Quantifier-Free Dynamic Complexity of Reachability
The dynamic complexity of the reachability query is studied in the dynamic complexity framework of Patnaik and Immerman, restricted to quantifier-free update formulas.
It is shown that, with this restriction, the reachability query cannot be dynamically maintained, neither with binary auxiliary relations nor with unary auxiliary functions, and that ternary auxiliary relations are more powerful with respect to graph queries than binary auxiliary relations. Further results are obtained including more inexpressibility results for reachability in a different setting, inexpressibility results for some other queries and normal forms for quantifier-free update programs.
KeywordsNormal Form Dynamic Program Dynamic Complexity Relation Symbol Auxiliary Data
Unable to display preview. Download preview PDF.
- 1.Patnaik, S., Immerman, N.: Dyn-FO: A parallel, dynamic complexity class. In: PODS, pp. 210–221. ACM Press (1994)Google Scholar
- 5.Hesse, W.: Dynamic Computational Complexity. PhD thesis, University of Massachusetts Amherst (2003)Google Scholar
- 6.Gelade, W., Marquardt, M., Schwentick, T.: The dynamic complexity of formal languages. In: STACS, pp. 481–492 (2009)Google Scholar
- 7.Grädel, E., Siebertz, S.: Dynamic definability. In: ICDT, 236–248 (2012)Google Scholar
- 8.Patrascu, M., Demaine, E.D.: Lower bounds for dynamic connectivity. In: Babai, L. (ed.) STOC, pp. 546–553. ACM (2004)Google Scholar
- 9.Zeume, T., Schwentick, T.: On the quantifier-free dynamic complexity of reachability. CoRR abs/1306.3056 (2013), http://arxiv.org/abs/1306.3056
- 12.Etessami, K.: Dynamic tree isomorphism via first-order updates. In: PODS, pp. 235–243. ACM Press (1998)Google Scholar