Small Dynamic Complexity Classes: An Investigation into Dynamic Descriptive Complexity: 10110 (Lecture Notes in Computer Science, 10110) - Softcover

Zeume, Thomas

 
9783662543139: Small Dynamic Complexity Classes: An Investigation into Dynamic Descriptive Complexity: 10110 (Lecture Notes in Computer Science, 10110)
Softcover
ISBN 10: 3662543133 ISBN 13: 9783662543139
Publisher: Springer, 2017

Synopsis

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

"synopsis" may belong to another edition of this title.

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.

From the Back Cover

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

"About this title" may belong to another edition of this title.

Publisher
Springer
Publication date
2017
Language
English
ISBN 10 
3662543133
ISBN 13 
9783662543139
Binding
Paperback
Edition number
1
Number of pages
157

Other Popular Editions of the Same Title

9783662543153: Small Dynamic Complexity Classes: An Investigation into Dynamic Descriptive Complexity

Featured Edition

ISBN 10:  366254315X ISBN 13:  9783662543153
Publisher: Springer, 2017
Softcover