Screen LibrarySmall 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 dyn...
Saved in:
| Main Authors: | |
|---|---|
| Corporate Authors: | |
| Published: |
Springer Berlin Heidelberg : Imprint: Springer,
|
| Publisher Address: | Berlin, Heidelberg : |
| Publication Dates: | 2017. |
| Literature type: | eBook |
| Language: | English |
| Series: |
Lecture Notes in Computer Science,
10110 |
| Subjects: | |
| Online Access: |
http://dx.doi.org/10.1007/978-3-662-54314-6 |
| Summary: |
"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. |
| Carrier Form: | 1 online resource(VIII,149pages): illustrations. |
| ISBN: | 9783662543146 |
| Index Number: | QA76 |
| CLC: | TP302.2 |
| Contents: | Dynamic Complexity: Definitions and Examples -- Relating Small Dynamic Complexity Classes -- Lower Bounds for Dynamic Complexity Classes. . |