Small Dynamic Complexity Classes

An Investigation into Dynamic Descriptive Complexity

  • Thomas Zeume

Part of the Lecture Notes in Computer Science book series (LNCS, volume 10110)

Also part of the Theoretical Computer Science and General Issues book sub series (LNTCS, volume 10110)

Table of contents

  1. Front Matter
    Pages I-VIII
  2. Thomas Zeume
    Pages 1-10
  3. Thomas Zeume
    Pages 139-142
  4. Back Matter
    Pages 143-149

About this book


"Small Dynamic Complexity Classes" was awarded the E.W. Beth Dissertation Prize 2016 for outstanding dissertations in the fields of logic, language, and information. The thesis studies the foundations of query re-evaluation after modifying a database.  It explores the structure of small dynamic descriptive complexity classes and provides new methods for proving lower bounds in this dynamic context. One of the contributions to the former aspect helped to confirm the conjecture by Patnaik and Immerman (1997) that reachability can be maintained by first-order update formulas.


computational science dynamic complexity theory formal methods regular languages theory of computing complexity classes

Authors and affiliations

  • Thomas Zeume
    • 1
  1. 1.Fakultät für InformatikTU DortmundDortmundGermany

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag GmbH Germany 2017
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-662-54313-9
  • Online ISBN 978-3-662-54314-6
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
IT & Software