Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

STACS
2005
Springer

favoriteEmaildiscussreport

117views Theoretical Computer Science» more STACS 2005»

Dynamic Complexity Theory Revisited

13 years 10 months ago

Dynamic Complexity Theory Revisited

Download ls1-www.cs.uni-dortmund.de

Dynamic complexity investigates the required eﬀort to maintain knowledge about a property of a structure under changing operations. This article introduces a reﬁned 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 LOGCFLcomplete problem D2LREACH(acyclic) can be maintained with ﬁrst-order updates.

Volker Weber, Thomas Schwentick

Real-time Traffic

Dynamic Complexity | Dynamic Problems | STACS 2005 | Structural Complexity Notions | Theoretical Computer Science |

claim paper

Related Content

» Intransitivity revisited coevolutionary dynamics of numbers games

» The Complexity of Planning Revisited A Parameterized Analysis

» The Theory of Calculi with Explicit Substitutions Revisited

» On Learning Algorithms for Nash Equilibria

» The 1Versus2 Queries Problem Revisited

» Design theory for dynamic complexity in information infrastructures the case of building i...

» Can complexity science support the engineering of critical network infrastructures

» Revisiting a limit on efficient quantum computation

» The Problem of Transitivity of PartWhole Relations in Conceptual Modeling Revisited

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	STACS
Authors	Volker Weber, Thomas Schwentick

Comments (0)