Small Dynamic Complexity Classes

Thomas Zeume

ISBN 10: 3662543133 / ISBN 13: 9783662543139

Published by Springer, Springer Feb 2017, 2017

About this Item

This item is printed on demand - Print on Demand Titel. Neuware -'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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 160 pp. Englisch.

Seller Inventory # 9783662543139

Bibliographic Details

• Title: Small Dynamic Complexity Classes
• Publisher: Springer, Springer Feb 2017
• Publication Date: 2017
• Language: English
• ISBN 10: 3662543133
• ISBN 13: 9783662543139
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 9D millimeters 235 millimeters width by 155 millimeters height by 9 millimeters depth
• Weight: 254 grams

About this title

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.

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.