Small Dynamic Complexity Classes - An Investigation into Dynamic Descriptive Complexity

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

Sommario

Dynamic Complexity: Definitions and Examples.- Relating Small Dynamic Complexity Classes.- Lower Bounds for Dynamic Complexity Classes. 

Dettagli sul prodotto

• Autori: Thomas Zeume
• Editore: Springer, Berlin
• Lingue: Inglese
• Formato: Tascabile
• Pubblicazione: 18.02.2017
• EAN: 9783662543139
• ISBN: 978-3-662-54313-9
• Pagine: 149
• Dimensioni: 157 mm x 10 mm x 235 mm
• Peso: 258 g
• Illustrazioni: VIII, 149 p. 17 illus.
• Serie: Lecture Notes in Computer Science; Theoretical Computer Science and General Issues
• Categorie: Scienze naturali, medicina, informatica, tecnica > Informatica, EDP > Informatica; B, Software Engineering, Algorithms, computer science, Theory of Computation, Logics and Meanings of Programs, Programming Techniques, Programming Languages, Compilers, Interpreters, Computer programming, Algorithms & data structures, Mathematical theory of computation, Computer programming / software engineering, Algorithm Analysis and Problem Complexity, Mathematical logic, Mathematical Logic and Foundations, Mathematical Logic and Formal Languages, Computer architecture & logic design, Programming & scripting languages: general, Compilers & interpreters, Programming languages (Electronic computers), Computer logic