William Hesse The dynamic complexity of transitive closure is in DynTC0. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2003, v:3, n:296, pp:473-485 [Journal]
Some Algebraic Problems with Connections to Circuit Complexity of Dynamic Data Structures. [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP