A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
On the Quantifier-Free Dynamic Complexity of Reachability
[chapter]
2013
Lecture Notes in Computer Science
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
doi:10.1007/978-3-642-40313-2_73
fatcat:iozpve6kdvhxvh65tvlbrwj6lq