Complete Problems for Dynamic Complexity Classes

Authors:
William Hesse;Neil Immerman
Affiliations:
-;-
Venue:
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Year:
2002

Citing 0
Cited 8

Incremental Validation of XML Documents

ICDT '03 Proceedings of the 9th International Conference on Database Theory
Incremental validation of XML documents

ACM Transactions on Database Systems (TODS)
SIGACT news complexity theory column 49

ACM SIGACT News
A Game Theoretic Approach to the Analysis of Dynamic Networks

Electronic Notes in Theoretical Computer Science (ENTCS)
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
Dynamic definability

Proceedings of the 15th International Conference on Database Theory
The dynamic complexity of formal languages

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present the first complete problems for dynamic complexity classes including the classes Dyn-FO and Dyn-ThC0, the dynamic classes corresponding to relational calculus and (polynomially bounded) SQL, respectively. The first problem we show complete for Dyn-FO is a single-step version of the circuit value problem (SSCV).Of independent interest, our construction also produces a first-order formula, 驴, that is in a sense universal for all first-order formulas. Since first-order formulas are stratified by quantifier depth, the first-order formula 驴 emulates formulas of greater depth by iterated application. As a corollary we obtain a fixed quantifier block, QBC, that is complete for all first-order quantifier blocks.