ENGLISH

Small Dynamic Complexity Classes: An Investigation into Dynamic Descriptive Complexity

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2017
ISBN
978-3-662-54313-9, 978-3-662-54314-6, 112-114-116-1
DOI
10.1007/978-3-662-54314-6
Language
english
Format
PDF
Filesize
3 MB (2807794 bytes)
Series
Lecture Notes in Computer Science 10110
Edition
1
Pages
VIII, 149\156
Time added
2017-04-19 23:43:33

Description

"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.

Similar books