Overview
- Up-to-date results
- Extensive study of the power of logics in dynamic settings
- Document of the progress in dynamic complexity
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 10110)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (5 chapters)
Keywords
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.
Authors and Affiliations
About the author
Thomas Zeume received his PhD from the computer science department at the TU Dortmund University, advised by Thomas Schwentick. His research focuses on the connection of logic, complexity theory, and database theory. Thomas was awarded the E.W. Beth Dissertation Prize 2016 for outstanding dissertations in the fields of logic, language, and information and he received the Best Student Paper Award at the 2014 Mathematical Foundations of Computer Science conference.
Bibliographic Information
Book Title: Small Dynamic Complexity Classes
Book Subtitle: An Investigation into Dynamic Descriptive Complexity
Authors: Thomas Zeume
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-662-54314-6
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag GmbH Germany 2017
Softcover ISBN: 978-3-662-54313-9Published: 18 February 2017
eBook ISBN: 978-3-662-54314-6Published: 15 February 2017
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: VIII, 149
Number of Illustrations: 17 b/w illustrations
Topics: Logics and Meanings of Programs, Software Engineering, Mathematical Logic and Formal Languages, Programming Languages, Compilers, Interpreters, Algorithm Analysis and Problem Complexity, Programming Techniques