Autorenfreundlich Bücher kaufen?!
Beschreibung
"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.
An Investigation into Dynamic Descriptive Complexity
Details
| Verlag | Springer Berlin |
| Ersterscheinung | 18. Februar 2017 |
| Maße | 23.5 cm x 15.5 cm |
| Gewicht | 254 Gramm |
| Format | Softcover |
| ISBN-13 | 9783662543139 |
| Auflage | 1st ed. 2017 |
| Seiten | 149 |
Schlagwörter
Algorithmen und Datenstrukturen, Algorithms, Compiler und Übersetzer, Compilers and Interpreters, Computer Science Logic and Foundations of Programming, Computerprogrammierung und Softwareentwicklung, Formal Languages and Automata Theory, Programming Techniques, Software Engineering, Theoretische Informatik
Herstellerinformationen
Bekannt durch
