Author:
Bouyer Patricia,Jugé Vincent
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Mix Barrington, D.A., Immerman, N., Straubing, H.: On uniformity within $$NC^{1}$$. J. Comput. Syst. Sci. 41(3), 274–306 (1990)
2. Bouyer, P., Jugé, V.: Dynamic complexity of the Dyck reachability. Research Report arXiv/1610.07499, Computing Research Repository, October 2016
3. Lecture Notes in Computer Science;S Datta,2015
4. Demri, S., Gascon, R.: The effects of bounding syntactic resources on Presburger LTL. J. Logic Comput. 19(6), 1541–1575 (2009)
5. Dong, G., Jianwen, S.: Incremental and decremental evaluation of transitive closure by first-order queries. Inf. Comput. 120(1), 101–106 (1995)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Dynamic Complexity of Expansion;Computer Science – Theory and Applications;2021
2. Sketches of Dynamic Complexity;ACM SIGMOD Record;2020-12-09