Small Dynamic Complexity Classes An Investigation into Dynamic Descriptive Complexity /

• Κύριος συγγραφέας: Zeume, Thomas (Συγγραφέας)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2017.
• Σειρά: Lecture Notes in Computer Science, 10110
• Θέματα: Computer science.; Computer programming.; Software engineering.; Programming languages (Electronic computers).; Algorithms.; Computer logic.; Mathematical logic.; Computer Science.; Logics and Meanings of Programs.; Software Engineering.; Mathematical Logic and Formal Languages.; Programming Languages, Compilers, Interpreters.; Algorithm Analysis and Problem Complexity.; Programming Techniques.
• Φυσική περιγραφή: VIII, 149 p. 17 illus. online resource.
• ISBN: 9783662543146
• ISSN: 0302-9743 ;

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