Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
Fast parallel arithmetic via modular representation
SIAM Journal on Computing
On threshold circuits and polynomial computation
SIAM Journal on Computing
Incremental and decremental evaluation of transitive closure by first-order queries
Information and Computation
Dyn-FO: a parallel, dynamic complexity class
Journal of Computer and System Sciences - Special issue on principles of database systems
Dynamic tree isomorphism via first-order updates to a relational database
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On Impossibility of Decremental Recomputation of Recursive Queries in Relational Calculus and SQL
DBLP-5 Proceedings of the Fifth International Workshop on Database Programming Languages
Incremental Recomputation of Recursive Queries with Nested Sets and Aggregate Functions
DBLP-6 Proceedings of the 6th International Workshop on Database Programming Languages
Uniform Circuits for Division: Consequences and Problems
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
A Game Theoretic Approach to the Analysis of Dynamic Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
Accomplishing approximate FCFS fairness without queues
HiPC'07 Proceedings of the 14th international conference on High performance computing
Incremental query evaluation in a ring of databases
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Dynamic complexity theory revisited
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Incremental algorithms for inter-procedural analysis of safety properties
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
The dynamic complexity of formal languages
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
This paper presents a fully dynamic algorithm for maintaining the transitive closure of a binary relation. All updates and queries can be computed by constant depth threshold circuits of polynomial size (TC0 circuits). This places dynamic transitive closure in the dynamic complexity class DynTC0, and implies that transitive closure can be maintained in database systems that include first-order update queries and aggregation operators, using a database with size polynomial in the size of the relation.