Dynamic complexity theory revisited

Authors:
Volker Weber;Thomas Schwentick
Affiliations:
FB Mathematik und Informatik, Philipps-Universität Marburg;FB Mathematik und Informatik, Philipps-Universität Marburg
Venue:
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Year:
2005

Citing 18
Cited 3

Languages that capture complexity classes

SIAM Journal on Computing
Complexity models for incremental computation

Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Limits to parallel computation: P-completeness theory

Limits to parallel computation: P-completeness theory
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
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Arity bounds in first-order incremental evaluation and definition of polynomial time database queries

Journal of Computer and System Sciences - Fourteenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
Computing LOGCFL certificates

Theoretical Computer Science
Deterministic FOIES are strictly weaker

Annals of Mathematics and Artificial Intelligence
Developments from a June 1996 seminar on Online algorithms: the state of the art

Developments from a June 1996 seminar on Online algorithms: the state of the art
Complete Problems for Dynamic Complexity Classes

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
First-Order Incremental Evaluation of Datalog Queries

DBLP-4 Proceedings of the Fourth International Workshop on Database Programming Languages - Object Models and Languages
Incremental Recomputation of Recursive Queries with Nested Sets and Aggregate Functions

DBLP-6 Proceedings of the 6th International Workshop on Database Programming Languages
On the Power of Incremental Evaluation in SQL-Like Languages

DBPL '99 Revised Papers from the 7th International Workshop on Database Programming Languages: Research Issues in Structured and Semistructured Database Programming
Incremental recomputation in local languages

Information and Computation
The dynamic complexity of transitive closure is in DynTC0

Theoretical Computer Science - Database theory
A fully dynamic reachability algorithm for directed graphs with an almost linear update time

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing

Consistent query answering in databases

ACM SIGMOD Record
Complexity of consistent query answering in databases under cardinality-based and incremental repair semantics

ICDT'07 Proceedings of the 11th international conference on Database Theory
Dynamic definability

Proceedings of the 15th International Conference on Database Theory

Quantified Score

Hi-index	0.01

Visualization

Abstract

Dynamic complexity asks for the effort needed to maintain the information about properties of a structure under operations changing the structure. This paper introduces a refined notion of dynamic problems which takes the initial structure into account. It develops the basic structural complexity notions accordingly. It also shows that the dynamic version of the LOGCFL-complete problem D2LREACH can be maintained with first-order updates.