Small Dynamic Complexity Classes: An Investigation into Dynamic Descriptive Complexity (Theoretical Computer Science and General Issues, Band 10110) - Softcover

Zeume, Thomas

 
9783662543139: Small Dynamic Complexity Classes: An Investigation into Dynamic Descriptive Complexity (Theoretical Computer Science and General Issues, Band 10110)
Softcover
ISBN 10: 3662543133 ISBN 13: 9783662543139
Verlag: Springer, 2017

Inhaltsangabe

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

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Über die Autorin bzw. den Autor

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.

Von der hinteren Coverseite

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

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Verlag
Springer
Erscheinungsdatum
2017
Sprache
Englisch
ISBN 10 
3662543133
ISBN 13 
9783662543139
Einband
Taschenbuch
Auflage
1
Anzahl der Seiten
160
Kontakt zum Hersteller
ProductSafety@springernature.com
ProductSafety@springernature.com

Poststr. 9
Darmstadt
64293
Deutschland

Weitere beliebte Ausgaben desselben Titels

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

Vorgestellte Ausgabe

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